Abstract
| Original language | English |
|---|---|
| Title of host publication | 2013 Proceedings IEEE INFOCOM |
| Publisher | Institute of Electrical and Electronic Engineers IEEE |
| 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
}
Can P2P networks be super-scalable? / Baccelli, François; Mathieu, Fabien; Norros, Ilkka; Varloot, Rémi.
2013 Proceedings IEEE INFOCOM. Institute of Electrical and Electronic Engineers IEEE, 2013. p. 1753-1761.Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-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 - Institute of Electrical and Electronic Engineers IEEE
ER -