This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Performance of Content Delivery under Competition in a Stochastic Unstructured Peer-to-Peer Network
October 2010 (vol. 21 no. 10)
pp. 1487-1500
Yuh-Ming Chiu, Yahoo! 12F, Taipei
Do Young Eun, North Carolina State University, Raleigh
Peer-to-peer (P2P) network is widely used for transferring large files nowadays. Measurement results show that most downloading peers are patient as the average download session is usually very long. It is sometimes even longer than downloading from a dedicated server using a modem. Existing results in the literature indicate that the stochastic fluctuation and the heterogeneity in the service capacity of each peer are two of the major reasons that make the average download time far longer than expected. In those studies, it has been often assumed that there is only one downloading peer in the network, ignoring the interaction and competition among peers. In this paper, we investigate the impact of the interaction and competition among peers on downloading performance under stochastic, heterogeneous, and unstructured P2P settings, thereby greatly extending the existing results on stochastic P2P networks made only under a single downloading peer in the network. To analyze the average download time in a P2P network with multiple competing downloading peers, we first introduce the notion of system utilization tailored to a P2P network. We investigate the relationship among the average download time, system utilization, and the level of competition among downloading peers in a stochastic P2P network. We then derive an achievable lower bound on the average download time and propose algorithms to give the peers the minimum average download time. Our result can much improve the download performance compared to earlier results in the literature. The performance of the different algorithms is compared under NS-2 simulations. Our results also provide theoretical explanation to the inconsistency of performance improvement by using parallel connections (parallel connections sometimes do not outperform a single connection) observed in some measurement studies.

[1] Y.M. Chiu and D.Y. Eun, "On the Performance of Download Strategies in a p2p Like Network," Proc. IEEE Global Comm. Conf. (Globecom), Nov. 2007.
[2] B. Cohen, BitTorrent Protocol Specification, http://www.bittorrent. orgprotocol.html , 2008.
[3] The Annotated Gnutella Protocol Specification v0.4, The Gnutella Developer Forum, http://rfc-gnutella.sourceforge.net/ developer/ stableindex.html, 2010.
[4] E. Sharman Networks, Kazaa, http://www.kazaa.com/us/helpnew_p2p.htm, 2010.
[5] X. Yang and G. de Veciana, "Service Capacity of Peer to Peer Networks," Proc. IEEE INFOCOM, Mar. 2004.
[6] S. Saroiu, K.P. Gummadi, and S.D. Gribble, "A Measurement Study of Peer-to-Peer File Sharing Systems," Proc. Conf. ACM Multimedia Computing and Networking (MMCN), 2002.
[7] K.P. Gummadi, R.J. Dunn, and S. Saroiu, "Measurement, Modeling, and Analysis of a Peer-to-Peer File Sharing Workload," Proc. ACM Symp. Operating Systems Principles (SOSP), 2003.
[8] B. Cohen, "Incentives Build Robustness in Bittorrent," Proc. First Workshop Economics of Peer-to-Peer Systems, http://citeseer.ist. psu.educohen03incentives.html , June 2003.
[9] S. Jun and M. Ahamad, "Incentives in Bittorrent Induce Free Riding," Proc. ACM SIGCOMM Workshop Economics of Peer-to-Peer Systems, Aug. 2005.
[10] M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, and A. Venkataramani, "Do Incentives Build Robustness in Bittorrent?" Proc. USENIX Symp. Networked Systems Design and Implementation (NSDI), Apr. 2007.
[11] K. Eger and U. Killat, "Fair Resource Allocation in Peer-to-Peer Networks," Computer Comm., vol. 30, no. 16, pp. 3046-3054, June 2007.
[12] T. Locher, S. Schmid, and R. Wattenhofer, "Rescuing Tit-for-Tat with Source Coding," Proc. IEEE Int'l Conf. Peer-to-Peer Computing (P2P '07), pp. 3-10, 2007.
[13] K. Eger and U. Killat, "Bandwidth Trading in Bittorrent-Like p2p Networks for Content Distribution," Computer Comm. vol. 31, no. 2, pp. 201-211, 2008.
[14] D. Qiu and R. Srikant, "Modelling and Performance Analysis of Bittorrent-Like Peer-to-Peer Networks," Proc. ACM SIGCOMM, Aug. 2004.
[15] Y.M. Chiu and D.Y. Eun, "Minimizing File Download Time in Stochastic Peer-to-Peer Networks," IEEE/ACM Trans. Networking, vol. 16, no. 2, pp. 253-266, Apr. 2008.
[16] D.S. Bernstein, Z. Feng, and B.N. Levine, "Adaptive Peer Selection," Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), Feb. 2003.
[17] M. Adler, R. Kumar, K. Ross, D. Rubenstein, D. Turner, and D.D. Yao, "Optimal Peer Selection in a Free-Market Peer-Resource Economy," Proc. Workshop Economics of Peer-to-Peer Systems, June 2004.
[18] M. Adler, R. Kumar, K. Ross, D. Rubenstein, D. Turner, and D.D. Yao, "Optimal Peer Selection for p2p Downloading and Streaming," Proc. IEEE INFOCOM, Mar. 2005.
[19] "The Network Simulator ns-2," http://www.isi.edu/nsnamns, 2010.
[20] C. Gkantsidis, M. Ammar, and E. Zegura, "On the Effect of Large-Scale Deployment of Parallel Downloading," Proc. IEEE Workshop Internet Applications (WIAPP), June 2003.
[21] S. Koo, C. Rosenberg, and D. Xu, "Analysis of Parallel Downloading for Large File Distribution," Proc. IEEE Int'l Workshop Future Trends in Distributed Computing Systems (FTDCS), May 2003.
[22] M. Lin, B. Fan, J.C.S. Lui, and D.M. Chiu, "Stochastic Analysis of File-Swarming Systems," Performance Evaluation, vol. 64, nos. 9-12, pp. 856-875, 2007.
[23] T. Bonald, L. Massoulié, F. Mathieu, D. Perino, and A. Twigg, "Epidemic Live Streaming: Optimal Performance Trade-Offs," Proc. ACM SIGMETRICS, pp. 325-336, 2008.
[24] Y. Qiao, F.E. Bustamante, P.A. Dinda, S. Birrer, and D. Lu, "Improving Peer-to-Peer Performance through Server-Side Scheduling," ACM Trans. Computer Systems, vol. 26, no. 4, pp. 1-30, 2008.
[25] M. Zhang, Q. Zhang, L. Sun, and S. Yang, "Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?" IEEE J. Selected Areas Comm., vol. 25, no. 9, pp. 1678-1694, Dec. 2007.
[26] N. Hu and P. Steenkiste, "Evaluation and Characterization of Available Bandwidth Probing Techniques," IEEE J. Selected Areas Comm., vol. 21, no. 6, pp. 879-894, Aug. 2003.
[27] M. Jain and C. Dovrolis, "End-to-End Estimation of the Available Bandwidth Variation Range," Proc. ACM SIGMETRICS, June 2005.
[28] S.M. Ross, Stochastic Processes, second ed. John Wiley & Sons, 1996.
[29] D.P. Bertsekas, Nonlinear Programming. Athena Scientific, 1995.
[30] D.R. Choffnes and F.E. Bustamante, "Taming the Torrent: A Practical Approach to Reducing Cross-isp Traffic in Peer-to-Peer Systems," Proc. ACM SIGCOMM, vol. 38, no. 4, pp. 363-374, 2008.
[31] H. Xie, Y.R. Yang, A. Krishnamurthy, and A.S.Y. Liu, "P4p: Provider Portal for Applications," Proc. ACM SIGCOMM, 2008.
[32] "Peer-to-Peer Content Distribution: Using Client pc Resources to Store and Distribute Content in the Enterprise," technical report, Intel, http://www.intel.com/it/digital-enterprise peer-peer- content-distribution.pdf, Sept. 2003.

Index Terms:
Computer network performance, P2P networks.
Citation:
Yuh-Ming Chiu, Do Young Eun, "On the Performance of Content Delivery under Competition in a Stochastic Unstructured Peer-to-Peer Network," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 10, pp. 1487-1500, Oct. 2010, doi:10.1109/TPDS.2010.15
Usage of this product signifies your acceptance of the Terms of Use.