Now Suppose That There Are M Paths Between The Server And The Client No Two Path

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 rk, rk, . . ., rk. if the server can only 12n 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?

Posted in Uncategorized