SHARE
HELP

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.

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

### Question

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?

### kiriharaCken

Because server connect to the client by M paths so:

a) If the server uses a single path to send data to the client, then the maximum throughput is the maximum of set minimum{R1k, R2k,.., RNk} = max{min{R11, R21,.., RN1}, min{R12, R22,.., RN2}, ..., min{R1M, R2M,.., RNM}}

b)  If the server uses all the M paths to send data, then the maximum throughput is the sum of all throughput of each path

$\sum$i=1$\rightarrow$M (min{R1k, R2k,.., RNk})

Post the discussion to improve the above solution.