Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged peterson-davie
1
1 vote
0
0 answers
718
718 views
Peterson and Davie
Suppose that forwarding tables are all established and then C-E link fails.Question : What update will be there in the C and E tables after failure and which tables info...
prasoon raghav
718
views
asked
May 13, 2017
Computer Networks
peterson-davie
distance-vector-routing
+
–
0
0 votes
0
0 answers
1.4k
1.4k views
Peterson Davie Q.15,17
Graph links are given as A-C=3,A-D=8,B-E=2,C-F=6,C-E=1,D-E=2 (A)Give global distance vector table (B)Routing table at node D by Link State algorithm (C) Suppose the forwa...
Archies09
1.4k
views
asked
Jun 23, 2016
Computer Networks
link-state-routing
distance-vector-routing
peterson-davie
computer-networks
+
–
0
0 votes
2
2 answers
1.1k
1.1k views
Peterson Davie 3.38c
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% c...
Misbah Ghaya
1.1k
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
difficult
+
–
0
0 votes
1
1 answer
1.0k
1.0k views
Peterson Davie 3.38b
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% c...
Misbah Ghaya
1.0k
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
difficult
+
–
0
0 votes
2
2 answers
795
795 views
Peterson Davie 3.38a
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% c...
Misbah Ghaya
795
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
difficult
+
–
0
0 votes
1
1 answer
1.3k
1.3k views
Peterson Davie 3.37
Path $MTU$ is the smallest $MTU$ of any link on the current path (route) between two hosts. Assume we could discover the path $MTU$ of the path used in the previous exerc...
Misbah Ghaya
1.3k
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
1
1 answer
956
956 views
Peterson Davie 3.36
Suppose a $TCP$ message that contains $1024$ bytes of data and $20$ bytes of $TCP$ header is passed to $IP$ for delivery across two networks interconnected by a router (i...
Misbah Ghaya
956
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
1
1 answer
2.3k
2.3k views
Peterson Davie 3.35
Some signalling errors can cause entire ranges of bits in a packet to be overwritten by all $0$s or all $1$s. Suppose all the bits in the packet, including the Internet c...
Misbah Ghaya
2.3k
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
1
1 answer
743
743 views
Peterson Davie 3.34
Why does the Offset field in the $IP$ header measure the offset in $8$-byte units? (Hint: Recall that the Offset field is $13$ bits long.)
Misbah Ghaya
743
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
1
1 answer
1.6k
1.6k views
Peterson Davie 3.33
What aspect of $IP$ addresses makes it necessary to have one address per network interface, rather than just one per host? In light of your answer, why does $IP$ tolerate...
Misbah Ghaya
1.6k
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
1
1 answer
1.3k
1.3k views
Peterson Davie 3.32b
Suppose a $10$-Mbps Ethernet hub (repeater) is replaced by a $10$-Mbps switch, in an environment where all traffic is between a single server and $N$ "clients." Because a...
Misbah Ghaya
1.3k
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
0
0 answers
438
438 views
Peterson Davie 3.32a
Suppose a $10$-Mbps Ethernet hub (repeater) is replaced by a $10$-Mbps switch, in an environment where all traffic is between a single server and $N$ "clients. "Because a...
Misbah Ghaya
438
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
0
0 answers
550
550 views
Peterson Davie 3.30
A stage of an $n \times n$ banyan network consists of $(n/2) 2 \times 2$ switching elements. The first stage directs packets to the correct half of the network, the next ...
Misbah Ghaya
550
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
difficult
+
–
0
0 votes
0
0 answers
316
316 views
Peterson Davie 3.29c
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The swit...
Misbah Ghaya
316
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
0
0 answers
292
292 views
Peterson Davie 3.29c
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The swit...
Misbah Ghaya
292
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
0
0 answers
311
311 views
Peterson Davie 3.29b
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The swit...
Misbah Ghaya
311
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
0
0 answers
281
281 views
Peterson Davie 3.29a
Suppose that a switch is designed to have both input and output $FIFO$ buffering. As packets arrive on an input port they are inserted at the tail of the $FIFO$. The swit...
Misbah Ghaya
281
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
0
0 answers
381
381 views
Peterson Davie 3.28
Suppose a switch is built using a computer workstation and that it can forward packets at a rate of $500,000$ packets per second, regardless (within limits) of size. Assu...
Misbah Ghaya
381
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
+
–
0
0 votes
1
answers
1 answer
1.1k
1.1k views
Peterson Davie 3.27
Suppose a workstation has an $I/O$ bus speed of $1$ Gbps and memory bandwidth of $2$ Gbps. Assuming $DMA$ is used to move data in and out of main memory, how many interfa...
Misbah Ghaya
1.1k
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
routers-bridge-hubs-switches
numerical-answers
+
–
0
0 votes
1
1 answer
1.6k
1.6k views
Peterson Davie 3.26
Suppose a workstation has an $I/O$ bus speed of $800$ Mbps and memory bandwidth of $2$ Gbps. Assuming direct memory access (DMA) is used to move data in and out of main m...
Misbah Ghaya
1.6k
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
1
1 answer
576
576 views
Peterson Davie 3.25
Cell switching methods (like $ATM$) essentially always use virtual circuit switching rather than datagram forwarding. Give a specific argument why this is so (consider th...
Misbah Ghaya
576
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
0
0 answers
378
378 views
Peterson Davie 3.24
What percentage of an $ATM$ link's total bandwidth is consumed by the $ATM$ cell headers? Ignore padding to fill cells or $ATM$ adaptation layer headers.
Misbah Ghaya
378
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
1
1 answer
1.3k
1.3k views
Peterson Davie 3.23
Suppose a bridge has two of its ports on the same network. How might the bridge detect and correct this?
Misbah Ghaya
1.3k
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
1
1 answer
1.6k
1.6k views
Peterson Davie 3.4
Give forwarding tables for switches $S1$ to $S4$ in Figure 3.46. Each switch should have a default routing entry, chosen to forward packets with unrecognized destination ...
Misbah Ghaya
1.6k
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
1
1 answer
4.5k
4.5k views
Peterson Davie 3.3
For the network given in Figure 3.45, give the datagram forwarding table for each node. The links are labeled with relative costs; your tables should forward each packet ...
Misbah Ghaya
4.5k
views
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
0
0 answers
868
868 views
Peterson Davie 2.44c
Suppose the Ethernet transmission algorithm is modified as follows: After each successful transmission attempt, a host waits one or two slot times before attempting to tr...
Misbah Ghaya
868
views
asked
Apr 23, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
0
0 answers
445
445 views
Peterson Davie 2.44b
Suppose the Ethernet transmission algorithm is modified as follows: After each successful transmission attempt, a host waits one or two slot times before attempting to tr...
Misbah Ghaya
445
views
asked
Apr 23, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
0
0 answers
598
598 views
Peterson Davie 2.44a
Suppose the Ethernet transmission algorithm is modified as follows: After each successful transmission attempt, a host waits one or two slot times before attempting to tr...
Misbah Ghaya
598
views
asked
Apr 23, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
0 votes
0
0 answers
453
453 views
Peterson Davie 2.42c
Suppose the round-trip propagation delay for Ethernet is $46.4 \mu s$. This yields a minimum packet size of $512$ bits ($464$ bits corresponding to propagation delay $+48...
Misbah Ghaya
453
views
asked
Apr 23, 2016
Computer Networks
peterson-davie
+
–
0
0 votes
1
1 answer
729
729 views
Peterson Davie 2.42b
Suppose the round-trip propagation delay for Ethernet is $46.4 \mu s$. This yields a minimum packet size of $512$ bits ($464$ bits corresponding to propagation delay $+48...
Misbah Ghaya
729
views
asked
Apr 23, 2016
Computer Networks
peterson-davie
+
–
Page:
1
2
3
next »