Interactive end-of-chapter exercises


A comparison of client-server and P2P file distribution delays

In this problem, you'll compare the time needed to distribute a file that is initially located at a server to clients via either client-server download or peer-to-peer download. Before beginning, you might want to first review Section 2.5 and the discussion surrounding Figure 2.22 in the text.




The problem is to distribute a file of size F = 7 Gbits to each of these 6 peers. Suppose the server has an upload rate of u = 95 Mbps.

The 6 peers have upload rates of: u1 = 18 Mbps, u2 = 11 Mbps, u3 = 22 Mbps, u4 = 17 Mbps, u5 = 27 Mbps, and u6 = 25 Mbps

The 6 peers have download rates of: d1 = 12 Mbps, d2 = 31 Mbps, d3 = 34 Mbps, d4 = 28 Mbps, d5 = 12 Mbps, and d6 = 19 Mbps



Question List


1. What is the minimum time needed to distribute this file from the central server to the 6 peers using the client-server model?

2. For the previous question, what is the root cause of this specific minimum time? Answer as 's' or 'ci' where 'i' is the client's number

3. What is the minimum time needed to distribute this file using peer-to-peer download?

4. For question 3, what is the root case of this specific minimum time: the server (s), client (c), or the combined upload of the clients and the server (cu)




Solution


1. The minimum time needed to distribute the file = max of: N*F / US and F / dmin = 583.33 seconds.

2. The root cause of the minimum time was c1.

3. The minimum time needed to distribute the file = max of: F / US, F / dmin, and N * F / sum of ui for all i + uS = 583.33 seconds.

4. The root cause of the minimum time was c.



That's incorrect

That's correct

The answer was: 583.33

Question 1 of 4

The answer was: c1

Question 2 of 4

The answer was: 583.33

Question 3 of 4

The answer was: c

Question 4 of 4

Try Another Problem

We gratefully acknowledge the programming and problem design work of John Broderick (UMass '21), which has really helped to substantially improve this site.

Copyright © 2010-2022 J.F. Kurose, K.W. Ross
Comments welcome and appreciated: kurose@cs.umass.edu