Computer networks

Problem 2: Consider the network scenario in the figure below. K sources 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 Ro. You can assume that there are no other links or source-destination pairs in the network. Suppose that source S, has an infinitely large file it wants to send to destination D, (i.e, cach sources sends to a different destination) Si Rs RD RD Ro Dx 1. Suppose that K-10, Rs-100 Mbps, Ro 54 Mbps, and R-50 Gbps. What is the throughput between each source-destination pair? Where are the bottleneck links? 2. Suppose now that K-10, R,-100 Mbps, Ro- 1 Mbps, and R - 0.75 Gbps. What are the throughputs between each source-destination pair? Where are the bottleneck links? 3. In the scenario above, suppose we increase the capacity of the destination links to 100 Mbps. Will this increase the throughput between sources and destinations? Explain you answer 4. Now repeat 1 above, but assume that the link connecting SI to the network has a capacity of I Mbps, and that all other values are unchanged Submit a single pdf file with answers to the above questions. The naming convention of the file should be HWI yourlastname.pdf