Abstract
The peer-to-peer (P2P) network is heavily used for content distribution and is popularly used for internet file sharing. In a peer to peer network the average time to download a given file becomes a key metric for performance measure. The common approach of analyzing the average download time based on average service capacity is fundamentally flawed, and shown that the spatial heterogeneity of service capacities of different source peers and temporal fluctuations in service capacity of a single source peer have significant impact on increasing the average download time in P2P networks. This paper gives a comparative study of various downloading algorithms to effectively remove these negative factors thereby reducing the average download duration of a file.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yang, X., de Veciana, G.: Service capacity of peer to peer networks. In: Proc. IEEE INFOCOM, pp. 2242–2252 (March 2004)
Qiu, D., Srikant, R.: Modelling and performance analysis of Bittorrent-like peer-to-peer networks. In: Proc. ACM SIGCOMM (August 2004)
Gummadi, K.P., Dunn, R.J., Saroiu, S.: Measurement, modeling, and analysis of a peer-to-peer file sharing workload. In: ACM Symp. Operating Systems Principles, SOSP (2003)
Chiu, Y., Eun, D.: Minimizing file download time in peer to peer networks. IEEE/ACM Transactions on Networking 16(2), 253–266 (2008)
Ng, T., Chu, Y., Rao, S., Sripanidkulchai, K., Zhang, H.: Measurement- based optimization techniques for bandwidth-demanding peer-to-peer systems. In: Proc. IEEE INFOCOM, pp. 2199–2209 (April 2003)
Koo, S.G.M., Rosenberg, C., Xu, D.: Analysis of parallel downloading for large file distribution. In: Proc. IEEE Int. Workshop on Future Trends in Distributed Computing Systems (FTDCS), pp. 128–135 (May 2003)
Ramachandran, K.K., Sikdar, B.: An analytic framework for modeling peer to peer networks. In: Proc. IEEE INFOCOM, pp. 215–269 (March 2005)
Lehrfeld, M.R., Simco, G.: Choke-based Switching Algorithm in Stochastic P2P Networks to Reduce File Download Duration. In: IEEE 2010, pp. 127–130 (2010)
Saroiu, S., Gummadi, K.P., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: ACM Multimedia Computing and Networking, MMCN (2002)
Jain, M., Dovrolis, C.: End-to-end estimation of the available bandwidth variation range. In: Proc. ACM Sigmetrics (June 2005)
Hu, N., Steenkiste, P.: Evaluation and characterization of available bandwidth probing techniques. IEEE J. Sel. Areas Communication 21(6), 879–894 (2003)
Koo, S.G.M., Kannan, K., Lee, C.S.G.: Neighbor-selection strategy in peer-to-peer networks. In: Proceedings of IEEE International Conference on Computer Communications and Networks (ICCCN), Rosemont, IL (October 2004)
Sherwood, R., Braud, R., Bhattacharjee, B.: Slurpie: A cooperative bulk data transfer protocol. In: Infocom, Hong Kong (March 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Padmavathi, M., Suresh, R.M. (2012). Switching Algorithms in Peer to Peer Networks - Review. In: Meghanathan, N., Chaki, N., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. Computer Science and Engineering. CCSIT 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27308-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-27308-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27307-0
Online ISBN: 978-3-642-27308-7
eBook Packages: Computer ScienceComputer Science (R0)