Service capacity of peer to peer networks Export

@inproceedings{citeulike:867506, abstract = {We study the 'service capacity' of peer to peer (P2P) file sharing applications. We begin by considering a transient regime which is key to capturing the ability of such systems to handle bursty traffic, e.g., flash crowds. In this context our models, based on age dependent branching processes, exhibit exponential growth in service capacity, and permit the study of sensitivity of this growth to system policies and parameters. Then we consider a model for such systems in steady state and show how the average delay seen by peers would scale in the offered load and rate at which peers exit the system. We find that the average delays scale well in the offered load. In particular the delays are upper bounded by some constant given any offered load and even decrease in the offered load if peers exit the system slowly. We validate many of our findings by analyzing traces obtained from a second generation P2P application called BitTorrent.}, author = {Yang, Xiangying and de Veciana, G.}, booktitle = {INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies}, citeulike-article-id = {867506}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1354647}, journal = {INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies}, pages = {2242--2252}, posted-at = {2009-02-11 08:56:47}, priority = {2}, title = {Service capacity of peer to peer networks}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1354647}, volume = {4}, year = {2004} }

TY - CONF ID - citeulike:867506 L3 - citeulike-article-id:867506 N2 - We study the 'service capacity' of peer to peer (P2P) file sharing applications. We begin by considering a transient regime which is key to capturing the ability of such systems to handle bursty traffic, e.g., flash crowds. In this context our models, based on age dependent branching processes, exhibit exponential growth in service capacity, and permit the study of sensitivity of this growth to system policies and parameters. Then we consider a model for such systems in steady state and show how the average delay seen by peers would scale in the offered load and rate at which peers exit the system. We find that the average delays scale well in the offered load. In particular the delays are upper bounded by some constant given any offered load and even decrease in the offered load if peers exit the system slowly. We validate many of our findings by analyzing traces obtained from a second generation P2P application called BitTorrent. JF - INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies EP - 2252 TI - Service capacity of peer to peer networks VL - 4 T2 - INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies SP - 2242 AU - Yang, Xiangying AU - de Veciana, G PY - 2004/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1354647 ER -