Can P2P Networks be Super-Scalable? - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Can P2P Networks be Super-Scalable?

(1, 2, 3) , (3, 4) , (5) , (2)
1
2
3
4
5

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.
Fichier principal
Vignette du fichier
bmn-infocom.pdf (293.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00817069 , version 1 (23-04-2013)

Identifiers

Cite

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⟩
348 View
189 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More