The Tradition of Sharing

Help your friends and juniors by posting answers to the questions that you know. Also post questions that are not available.

To start with, Sr2Jr’s first step is to reduce the expenses related to education. To achieve this goal Sr2Jr organized the textbook’s question and answers. Sr2Jr is community based and need your support to fill the question and answers. The question and answers posted will be available free of cost to all.

Computer Networking : A Top-Down Approach

Computer Networking : A Top-down Approach

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



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?     




0 0


Post the discussion to improve the above solution.