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?
Answer
Discussions
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
= i=1
M (min{R1k, R2k,.., RNk})
Post the discussion to improve the above solution.