EBK COMPUTER NETWORKING
EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
Expert Solution & Answer
Book Icon
Chapter 1, Problem P10P

Explanation of Solution

The formula for calculating the link rate to transmit the required packet is LengthofthepacketTransmissionrateofthelink=LRi

The rate of first link required to transmit the packet at first end system is LR1  and similarly for second and third links LR2 and LR3

The formula for calculating the propagation speed of the packet over the link is LengthofthelinkPropagationspeedofthelink=disi

The propagation speed of the packet over the first link is d1s1 and similarly for second and third links d2s2 and d3s3

The processing delay of the packet at each switch is dproc

The end-to-end delay of the packets can be calculated by using the below expression

dend-to-end=LR1+LR2<

Blurred answer
Students have asked these similar questions
Computer Networks   Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3),  and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay?  In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but instead immediately transmits each bit it…
Computer Networks Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3),  and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, and the propagation speed on all three links are 3125km/sec, 10000 km/sec, and 3333km/sec respectively. The transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay?    In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward…
Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s , and R denote the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, , and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is 2.5⋅108m/s the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay?

Chapter 1 Solutions

EBK COMPUTER NETWORKING

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning