SHARE
SPREAD
HELP

The Tradition of Sharing

Help your friends and juniors by posting answers to the questions that you know. Also post questions that are not available.

To start with, Sr2Jr’s first step is to reduce the expenses related to education. To achieve this goal Sr2Jr organized the textbook’s question and answers. Sr2Jr is community based and need your support to fill the question and answers. The question and answers posted will be available free of cost to all.

The pleasure of all reading is doubled when one lives with another who shares the same. -Katherine Mansfield

 

#
Authors:
James F. Kurose, Keith W. Ross
Chapter:
Application Layer
Exercise:
Problems
Question:24 | ISBN:9780132856201 | Edition: 6

Question

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 u s ≤ (u s + u 1 + ... + u N )/N. Specify a distribution scheme

that has a distribution time of F/u s .

b. Suppose that u s ≥ (u s + u 1 + ... + u N )/N. Specify a distribution scheme

that has a distribution time of NF/(u s + u 1 + ... + u N ).

c. Conclude that the minimum distribution time is in general given by max{F/u s , NF/(u s + u 1 + ... + u N )}.

TextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbook

Answer

               

1 0

Discussions

Post the discussion to improve the above solution.