The figure depicts K sources which are connected to the Internet via links of capacity RS, and within the network fairly share a common link of capacity R to K destinations. Each destination is connected to the network by a link of capacity RD. You can assume that there are no other links or source-destination pairs in the network.
The figure depicts K sources which are connected to the Internet via links
of capacity RS, and within the network fairly share a common link of
capacity R to K destinations. Each destination is connected to the network
by a link of capacity RD. You can assume that there are no other links or
source-destination pairs in the network.
Now suppose that source Si has an infinitely large file it wants to send to
destination Di (i.e., each source sends to a different destination).
a. If K=10, RS = 100 Mbps, Rd=10 Mbps, and R = 10 Gbps. What is the
throughput between each source-destination pair? Where are the
bottleneck links?
b. If we now assume that K=10, RS = 100 Mbps, Rd= 100 Mbps, and R = 0.5
Gbps. What are the new throughputs between each source-destination
pair? Where are the bottle-neck links?
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
