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: 21

 

Question by Anonymous on 07 Sep, 2018 at 05:25 PM

Consider Figure 1.19(b). Now suppose that there are M paths between the server and the client. No two paths share any link. Path k (k = 1, . . ., M ) consists of N links with transmission rates Rk1, Rk2, . . ., RkN . If the server can only use one path to send data to the client, what is the maximum throughput that the server can achieve? If the server can use all M paths to send data, what is the maximum throughput that the server can achieve?     

Answer by Geroge on 25 Sep, 2016 at 04:32 PM

          

 

0 0

Discussions

Post the discussion improve the above solution.