Consider Figure 1.19(b). Now suppose that there are M paths between the server and the client. Nu two paths share any link. Path k (k = 1,...,M) consists of N links with transmission rates R^k₁, R^k₂, .. . , R^k_N. 1f 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?

Figure 1.19(b)

Transcribed Image Text:

RN R2 R1 Client Server