Computer Networking : A Top-Down Approach

Computer Networking : A Top-down Approach

Authors: James F. Kurose, Keith W. Ross
ISBN: 9780132856201
Edition: 6
Chapter: Computer Networks And The Internet
Exercise: Problems
Question: 23

 

Question by Anonymous on 05 May, 2017 at 04:18 PM

Consider Figure 1.19(a). Assume that we know the bottleneck link along the path from the server to the client is the first link with rate Rs bits/sec. Suppose we send a pair of packets back to back from the server to the client, and there is no other traffic on this path. Assume each packet of size L bits, and both links have the same propagation delay dprop. a. What is the packet inter-arrival time at the destination? That is, how much time elapses from when the last bit of the first packet arrives until the last bit of the second packet arrives?

b. Now assume that the second link is the bottleneck link (i.e., Rc < Rs). Is it possible that the second packet queues at the input queue of the second link? Explain. Now suppose that the server sends the second packet T seconds after sending the first packet. How large must T be to ensure no queuing before the second link? Explain.

Answer by Geroge on 05 May, 2017 at 04:18 PM

a)

b)

0 0

Discussions

Post the discussion improve the above solution.