- Scaling laws for file dissemination in P2P networks with random contacts
- 16th International Workshop on Quality of Service (IWQoS 2008), Enschede, the Netherlands
- Book/source title
- 16th International Workshop on Quality of Service: Enschede, The Netherlands, 2-4 June 2008
- Pages (from-to)
- Piscataway, NJ: IEEE Xplore
- Document type
- Conference contribution
- Faculty of Economics and Business (FEB)
- Amsterdam School of Economics Research Institute (ASE-RI)
In this paper we obtain the scaling law for the mean broadcast time of a file in a P2P network with an initial population of N nodes. In the model, at Poisson rate lambda a node initiates a contact with another node chosen uniformly at random. This contact is said to be successful if the contacted node possesses the file, in which case the initiator downloads the file and can later upload it to other nodes. In a network with altruistic nodes (i.e., nodes do not leave the network) we show that the mean broadcast time is O(log(N)). In a network with free-riding nodes, our main result shows that a O(log(N)) mean broadcast time can be achieved if nodes remain connected to the network for the duration of at least one more contact after downloading the file, otherwise a significantly worse O(N) time is required to broadcast the file.
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.