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.
| Original language | English |
|---|---|
| Title of host publication | 2013 Proceedings IEEE INFOCOM |
| Publisher | IEEE Institute of Electrical and Electronic Engineers |
| Pages | 1753-1761 |
| ISBN (Electronic) | 978-1-4673-5946-7, 978-1-4673-5945-0 |
| ISBN (Print) | 978-1-4673-5944-3 |
| DOIs | |
| Publication status | Published - 2013 |
| MoE publication type | A4 Article in a conference publication |
| Event | 32nd IEEE International Conference on Computer Communications, INFOCOM 2013 - Turin, Italy Duration: 14 Apr 2013 → 19 Apr 2013 Conference number: 32 |
Conference
| Conference | 32nd IEEE International Conference on Computer Communications, INFOCOM 2013 |
|---|---|
| Abbreviated title | INFOCOM 2013 |
| Country | Italy |
| City | Turin |
| Period | 14/04/13 → 19/04/13 |
Fingerprint
Keywords
- peer-to-peer networking
- system fluid limit
- scalability
Cite this
Baccelli, F., Mathieu, F., Norros, I., & Varloot, R. (2013). Can P2P networks be super-scalable? In 2013 Proceedings IEEE INFOCOM (pp. 1753-1761). IEEE Institute of Electrical and Electronic Engineers . https://doi.org/10.1109/INFCOM.2013.6566973