1. Consider distributing a file of F bits to N peers using a P2P architecture. Assume a fluid model. For simplicity assume that d min is very large, so that peer download bandwidth is never a...

1. Consider distributing a file of
F
bits to
N
peers using a P2P architecture. Assume a fluid model. For simplicity assume that
d_min

is very large, so that peer download bandwidth is never a bottleneck.

a. Suppose that us
(u_s

+
u
₁
+ . . . +
uN)/N. Specify a distribution scheme that has a distribution time of
F/u_s
.

b. Suppose that
u_s

(u_s

+
u
₁
+ . . . +
uN)/N. Specify a distribution scheme that has a distribution time of
NF/(u_s

+
u
₁
+ . . . +
uN).

c. Conclude that the minimum distribution time is in general given by max{F/u_s
,
NF/(u_s

+
u
₁
+ . . . +
uN)}.