Rd 10 x 1000,000 bps 213.3 s R 15 x 1000,000 bps Rs 420 S 10 Mbps 100 Mbps 320 S 15 Mbps 54 x 1000000 bps 100 x 1000000 bps 54 Mbps 10 x 1000,000 bps 400 x 1000000 b 15 x 1000,000 bps 400 x 1000,000 x 8 500 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 Rd. You can assume that there are no other links or source-destination pairs in the network. 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). Rs Rs Ro DK a. Suppose that K=5, Rs = 15 Mbps, Rd=54 Mbps, and R 50 Gbps. What is the throughput between each source-destination pair? Where are the bottleneck links? b. Suppose now that K=10, Rs = 100 Mbps, Rd= 15 Mbps, and R = 100 Mbps. What is the throughput between each source-destination pair? Where are the bottleneck links? | c. Calculate the transmission delay to send a file of size 400 MB from source to destination in part a. above. dtrans = d. Calculate the transmission delay to send a file of size 400 MB from source to destination in part b. above. dtrans =