loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 Eighth International Conference on Peer-to-Peer Computing
Playing with the Bandwidth Conservation Law
September 08-September 11
ISBN: 978-0-7695-3318-6
ASCII Text
x 
 
Farid Benbadis, Fabien Mathieu, Nidhi Hegde, Diego Perino, "Playing with the Bandwidth Conservation Law," Peer-to-Peer Computing, IEEE International Conference on, pp. 140-149, 2008 Eighth International Conference on Peer-to-Peer Computing, 2008.
 
 
BibTex
x
 
@article{ 10.1109/P2P.2008.50,
author = {Farid Benbadis and Fabien Mathieu and Nidhi Hegde and Diego Perino},
title = {Playing with the Bandwidth Conservation Law},
journal ={Peer-to-Peer Computing, IEEE International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3318-6},
pages = {140-149},
doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2008.50},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Peer-to-Peer Computing, IEEE International Conference on
TI - Playing with the Bandwidth Conservation Law
SN - 978-0-7695-3318-6
SP140
EP149
A1 - Farid Benbadis,
A1 - Fabien Mathieu,
A1 - Nidhi Hegde,
A1 - Diego Perino,
PY - 2008
KW - null
VL - 0
JA - Peer-to-Peer Computing, IEEE International Conference on
ER -
 
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.
Citation:
Farid Benbadis, Fabien Mathieu, Nidhi Hegde, Diego Perino, "Playing with the Bandwidth Conservation Law," p2p, pp.140-149, 2008 Eighth International Conference on Peer-to-Peer Computing, 2008
Usage of this product signifies your acceptance of the Terms of Use.