Can P2P networks be super-scalable?

François Baccelli, Fabien Mathieu, Ilkka Norros, Rémi Varloot

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

12 Citations (Scopus)

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 languageEnglish
Title of host publication2013 Proceedings IEEE INFOCOM
PublisherIEEE Institute of Electrical and Electronic Engineers
Pages1753-1761
ISBN (Electronic)978-1-4673-5946-7, 978-1-4673-5945-0
ISBN (Print)978-1-4673-5944-3
DOIs
Publication statusPublished - 2013
MoE publication typeA4 Article in a conference publication
Event32nd IEEE International Conference on Computer Communications, INFOCOM 2013 - Turin, Italy
Duration: 14 Apr 201319 Apr 2013
Conference number: 32

Conference

Conference32nd IEEE International Conference on Computer Communications, INFOCOM 2013
Abbreviated titleINFOCOM 2013
CountryItaly
CityTurin
Period14/04/1319/04/13

Fingerprint

Scalability
Fluids

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
Baccelli, François ; Mathieu, Fabien ; Norros, Ilkka ; Varloot, Rémi. / Can P2P networks be super-scalable?. 2013 Proceedings IEEE INFOCOM. IEEE Institute of Electrical and Electronic Engineers , 2013. pp. 1753-1761
@inproceedings{389901cc24984fcfa7cbabbf9d66b3c4,
title = "Can P2P networks be super-scalable?",
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.",
keywords = "peer-to-peer networking, system fluid limit, scalability",
author = "Fran{\cc}ois Baccelli and Fabien Mathieu and Ilkka Norros and R{\'e}mi Varloot",
note = "CA2: TK808 SDA: ICT Project code: 79075",
year = "2013",
doi = "10.1109/INFCOM.2013.6566973",
language = "English",
isbn = "978-1-4673-5944-3",
pages = "1753--1761",
booktitle = "2013 Proceedings IEEE INFOCOM",
publisher = "IEEE Institute of Electrical and Electronic Engineers",
address = "United States",

}

Baccelli, F, Mathieu, F, Norros, I & Varloot, R 2013, Can P2P networks be super-scalable? in 2013 Proceedings IEEE INFOCOM. IEEE Institute of Electrical and Electronic Engineers , pp. 1753-1761, 32nd IEEE International Conference on Computer Communications, INFOCOM 2013, Turin, Italy, 14/04/13. https://doi.org/10.1109/INFCOM.2013.6566973

Can P2P networks be super-scalable? / Baccelli, François; Mathieu, Fabien; Norros, Ilkka; Varloot, Rémi.

2013 Proceedings IEEE INFOCOM. IEEE Institute of Electrical and Electronic Engineers , 2013. p. 1753-1761.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

TY - GEN

T1 - Can P2P networks be super-scalable?

AU - Baccelli, François

AU - Mathieu, Fabien

AU - Norros, Ilkka

AU - Varloot, Rémi

N1 - CA2: TK808 SDA: ICT Project code: 79075

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - peer-to-peer networking

KW - system fluid limit

KW - scalability

U2 - 10.1109/INFCOM.2013.6566973

DO - 10.1109/INFCOM.2013.6566973

M3 - Conference article in proceedings

SN - 978-1-4673-5944-3

SP - 1753

EP - 1761

BT - 2013 Proceedings IEEE INFOCOM

PB - IEEE Institute of Electrical and Electronic Engineers

ER -

Baccelli F, Mathieu F, Norros I, Varloot R. Can P2P networks be super-scalable? In 2013 Proceedings IEEE INFOCOM. IEEE Institute of Electrical and Electronic Engineers . 2013. p. 1753-1761 https://doi.org/10.1109/INFCOM.2013.6566973