Name
Abstract | ||
|---|---|---|
We investigate performance bounds of P2P systems by application of the law of bandwidth conservation. This approach is quite general and allows us to consider various sharing systems such as fixed-rate streaming, VoD-type streaming, and elastic file sharing. Starting from a general law of bandwidth conservation, we consider several specific cases that apply to various P2P systems. For dynamic systems with a stationary arrival process, we show that simple seeding policies result in regimes where the download rates are arbitrarily fast. We consider a case with equal download rate among all peers as well as cases where the download rate is a function of upload rates, inspired by BitTorrent's Tit-for-Tat policy. In particular, we show that the sustainable proportion of free-riders is closely related to the Tit-for-Tat parameter. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/P2P.2008.50 | Peer-to-Peer Computing |
Keywords | Field | DocType |
bandwidth allocation,peer-to-peer computing,P2P systems,VoD-type streaming,bandwidth conservation law,dynamic systems,elastic file sharing,fixed-rate streaming,stationary arrival process | Bandwidth allocation,Computer science,Server,Upload,Computer network,Download,Bandwidth (signal processing),BitTorrent,File sharing,Conservation law,Distributed computing | Conference |
ISSN | Citations | PageRank |
2161-3567 | 7 | 0.92 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Farid Benbadis | 1 | 40 | 8.88 |
| Fabien Mathieu | 2 | 301 | 27.52 |
| Nidhi Hegde | 3 | 234 | 20.41 |
| Diego Perino | 4 | 740 | 50.54 |