Can P2P Networks be Super-Scalable?

François Baccelli 1, 2, 3 Fabien Mathieu 3, 4 Ilkka Norros 5 Rémi Varloot 2
2 DYOGENE - Dynamics of Geometric Networks
CNRS - Centre National de la Recherche Scientifique : UMR8548, Inria Paris-Rocquencourt, DI-ENS - Département d'informatique de l'École normale supérieure
4 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : We propose a new model for peer-to-peer networking which takes the network bottlenecks into account beyond the access. This model can cope with key features of P2P networking like degree or locality constraints together with the fact that distant peers often have a smaller rate than nearby peers. Using a network model based on rate functions, we give a closed form expression of peers download performance in the system's fluid limit, as well as approximations for the other cases. Our results show the existence of realistic settings for which the average download time is a decreasing function of the load, a phenomenon that we call super-scalability.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-00817069
Contributor : Fabien Mathieu <>
Submitted on : Tuesday, April 23, 2013 - 4:33:18 PM
Last modification on : Thursday, October 17, 2019 - 12:36:04 PM
Long-term archiving on : Monday, April 3, 2017 - 8:42:21 AM

Files

bmn-infocom.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00817069, version 1
  • ARXIV : 1304.6489

Citation

François Baccelli, Fabien Mathieu, Ilkka Norros, Rémi Varloot. Can P2P Networks be Super-Scalable?. IEEE Infocom 2013 - 32nd IEEE International Conference on Computer Communications, Apr 2013, Turin, Italy. ⟨hal-00817069⟩

Share

Metrics

Record views

601

Files downloads

322