Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for peterson-davie
0
votes
2
answers
1
Peterson Davie 2.18a
Suppose we want to transmit the message $11100011$ and protect it from errors using the CRC polynomial $x^{3}+1$. (a) Use polynomial long division to determine the message that should be transmitted.
Suppose we want to transmit the message $11100011$ and protect it from errors using the CRC polynomial $x^{3}+1$.(a) Use polynomial long division to determine the message...
makhdoom ghaya
469
views
makhdoom ghaya
asked
Apr 19, 2016
Computer Networks
peterson-davie
+
–
0
votes
1
answer
2
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$ bits of jam signal). (b) What are the drawbacks to so large a minimum packet size?
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...
makhdoom ghaya
469
views
makhdoom ghaya
asked
Apr 23, 2016
Computer Networks
peterson-davie
+
–
0
votes
1
answer
3
Peterson Davie 2.36a
(Figure 2.37) Suppose $A$ is connected to $B$ via an intermediate router $R$, as shown in Figure 2.37. The $A - R$ and $R - B$ links each accept and transmit only one packet per second in each direction (so two packets take $2$ seconds), and the two directions ... $0,1,2,3,4,5$, state what packets arrive at and leave each node, or label them on a timeline.
(Figure 2.37)Suppose $A$ is connected to $B$ via an intermediate router $R$, as shown in Figure 2.37. The $A - R$ and $R - B$ links each accept and transmit only one pack...
makhdoom ghaya
592
views
makhdoom ghaya
asked
Apr 23, 2016
Computer Networks
peterson-davie
+
–
1
votes
0
answers
4
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 information will be exchanged? what will be the table of A after C and E have reported the news?
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
480
views
prasoon raghav
asked
May 13, 2017
Computer Networks
peterson-davie
distance-vector-routing
+
–
0
votes
2
answers
5
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$% chance of losing the whole packet due to loss of a fragment. What is the ... loss of the whole packet if the packet is transmitted twice, (c) Explain how use of the Ident field might be applicable here.
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...
makhdoom ghaya
692
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
difficult
+
–
0
votes
2
answers
6
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$% chance of losing the whole packet due to loss of a fragment. What is ... of the whole packet if the packet is transmitted twice, (a) Assuming all fragments received must have been part of the same transmission?
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...
makhdoom ghaya
511
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
difficult
+
–
0
votes
1
answer
7
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 via the lowest-cost path to its destination.
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 ...
makhdoom ghaya
3.5k
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
8
Peterson Davie 2.39
What kind of problems can arise when two hosts on the same Ethernet share the same hardware address? Describe what happens and why that behavior is a problem.
What kind of problems can arise when two hosts on the same Ethernet share the same hardware address? Describe what happens and why that behavior is a problem.
makhdoom ghaya
2.6k
views
makhdoom ghaya
asked
Apr 23, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
9
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 checksum, are overwritten. Could a packet with all $0$s or all $1$s be a legal $IPv4$ packet? Will the Internet checksum catch that error? Why or why not?
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...
makhdoom ghaya
1.9k
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
10
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 memory, how many interfaces to $100$-Mbps Ethernet links could a switch based on this workstation handle?
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...
makhdoom ghaya
1.2k
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
0
answers
11
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 forwarding tables are all established as in (A) and then the C–E ... have reported the news. (ii) The tables of A and D after their next mutual exchange. (iii) The table of C after A exchanges with it.
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
922
views
Archies09
asked
Jun 23, 2016
Computer Networks
link-state-routing
distance-vector-routing
peterson-davie
computer-networks
+
–
0
votes
1
answer
12
Peterson Davie 3.23
Suppose a bridge has two of its ports on the same network. How might the bridge detect and correct this?
Suppose a bridge has two of its ports on the same network. How might the bridge detect and correct this?
makhdoom ghaya
966
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
13
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 all traffic must still traverse the server-switch link, nominally there is no improvement in bandwidth. (b) What other advantages and drawbacks might a switch offer versus a hub?
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...
makhdoom ghaya
939
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
1
votes
1
answer
14
Peterson Davie 2.37
Suppose $A$ is connected to $B$ via an intermediate router $R$, as in the previous problem. The $A - R$ link is instantaneous, but the $R - B$ link transmits only one packet each second, one at a time (so two packets take $2$ seconds). Assume $A$ sends to $B$ ... Time = $0,1,2,3,4$, state what packets arrive at and are sent from A and B. How large does the queue at $R$ grow?
Suppose $A$ is connected to $B$ via an intermediate router $R$, as in the previous problem. The $A - R$ link is instantaneous, but the $R - B$ link transmits only one pac...
makhdoom ghaya
568
views
makhdoom ghaya
asked
Apr 23, 2016
Computer Networks
peterson-davie
+
–
0
votes
2
answers
15
Peterson Davie 2.23a
Consider an $ARQ$ algorithm running over a $40$-km point-to-point fiber link. (a) Compute the one-way propagation delay for this link, assuming that the speed of light is $2 \times 108$ m/s in the fiber.
Consider an $ARQ$ algorithm running over a $40$-km point-to-point fiber link.(a) Compute the one-way propagation delay for this link, assuming that the speed of light is ...
makhdoom ghaya
1.4k
views
makhdoom ghaya
asked
Apr 22, 2016
Computer Networks
peterson-davie
+
–
0
votes
1
answer
16
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 point-to-point interfaces that have nonunique addresses or no addresses?
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...
makhdoom ghaya
1.3k
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
17
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$% chance of losing the whole packet due to loss of a fragment. What is ... loss of the whole packet if the packet is transmitted twice, (b) Assuming any given fragment may have been part of either transmission?
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...
makhdoom ghaya
775
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
difficult
+
–
0
votes
1
answer
18
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 addresses toward OUT. Any specific destination table entries duplicated by the default entry should then be eliminated.
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 ...
makhdoom ghaya
1.2k
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
19
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 the preceding question).
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...
makhdoom ghaya
331
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
0
votes
1
answer
20
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 exercise, and that we use this value as the $MTU$ for all the path segments. Give the sizes and offsets of the sequence of fragments delivered to the network layer at the destination host.
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...
makhdoom ghaya
891
views
makhdoom ghaya
asked
Apr 24, 2016
Computer Networks
peterson-davie
descriptive
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register