Open Access Open Access  Restricted Access Subscription or Fee Access

A Survey of Peer To Peer Network

R. Maruthaveni, S. kalaivani


This paper offers a survey of the emerging field of private peer-to-peer networks, which can be defined as Internet overlays in which the resources and infrastructure are provided by the users, and new users may only join by personal invitation. The last few years have seen rapid developments in this field, many of which have not previously been described in the research literature. In recent years, peer-to-peer (P2P) networks have soared in popularity in the form of file sharing applications. With this popularity come security implications and vulnerabilities. In this paper, we examining the framework on which most P2P networks are built, and from this, we examine how attacks on P2P networks leverage the very essence of the networks itself: decentralization of resources and of control. Additionally, we look at the privacy and usage attacks that arise in P2P networks as well as approaches that can be used address some of these issues.


Peer to Peer Network, Group-Based Networks, Friend-to-Friend Networks, File Sharing Networks.

Full Text:



A. M. Law and D. M. Kelton, Simulation Modeling and Analysis. McGraw-Hill Higher Education, 1999.

S. Joseph, “An Extendible Open Source P2P Simulator”, P2P Journal, pp. 1–15, 2003.

D. Qiu and R. Srikant, “Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks”, in SIGCOMM ‟04: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York, NY, USA: ACM Press, 2004, pp. 367–378..

B. Cohen, “Incentives Build Robustness in Bittorrent,” in Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, USA, June 2003..

S. Saroiu, K. Gummadi, and S. Gribble, “Measuring and Analyzing the Characteristics of Napster and Gnutella Host”, Multimedia Systems, vol. 9, no. 2, pp. 170–184, 2003.

M. T. Schlosser and S. D. Kamvar, “Simulating a File Sharing P2P Network”, Stanford University, Tech. Rep., 2002.

“Planetlab,” accessed 01-May-2006. [Online]. Available:

I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications”, IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 17–32, 2003.

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications”, in SIGCOMM ‟01: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York, NY, USA: ACM Press, 2001, pp. 149–160..

F. Dabek, J. Li, E. Sit, J. Robertson, M. Kaashoek, and R. Morris, “Designing a DHT for Low Latency and High Throughput”, Proc. NSDI, vol. 4, 2004.

S. Saroiu, P. K. Gummadi, and S. D. Gribble, “A measurement study of peer-to-peer file sharing systems,” in Proceedings of the Multimedia Computing and Networking (MMCN), San Jose, California, USA, January 2002..

B. Krishnamurthy, J. Wang, and Y. Xie, “Early measurement of a cluster-based architecture for p2p systems,” in Proceedings of the ACM SIGCOOM Internet Measurement Workshop, San Francisco, USA, November 2001.

A. Barab´asi, R. Albert, H. Jeong, and G. Bianconi, “Power-law distribution of the world wide web,” Science, vol. 287, 2000.

R. Albert, H. Jeong, and A. Barab´asi, “Diameter of the world wide web Nature”, vol. 401, pp. 130–131, 1999.

M. Faloutsos, P.Faloutsos, and C. Faloutsos, “On power-law relationships of the internet topology”, in Processings of the SIGCOMM 1999.

K. P. Gummadi, R. J. Dunn, S. Saroiu, S. D. Gribble, H. M. Levy, and J. Zahorjan, “Measurement, modeling, and analysis of a peer-to-peer file sharing workload”, in rocessings of the SOSP, Bolton Landing, New York, USA, October 19-22 2003.

A. Goel and R. Govindan, “Using the small-world model to improve freenet performance”, Computer Networks Journal, vol. 46, no. 4, pp. 555–574, November 2004.

Morris R, Liben-Nowell D, Karger D.R, Kaashoek M.F, Dabek F, Balakrishnan H, “Chord: a scalable peer-to-peer lookup protocol for Internet applications”, IEEE/ACM Transactions on Networking, 11 Issue:1, page(s): 17 – 32, Feb 2003.

Ahmed, R.; Boutaba, R, “A Scalable Peer-to-Peer Protocol Enabling Efficient Subset Search”, IEEE/ACM Transactions on Networking, 17 Issue:1, page(s): 130 – 143, 2009.

Hanhua Chen; Hai Jin; Liu, Y.; Ni, L.M., “Difficulty-Aware Hybrid Search in Peer-to-Peer Networks”, IEEE Transactions on Parallel and Distributed Systems, 20 Issue:1, page(s): 71 – 82, 2009.

M. Meo and F. Milan, “A rational model for service rate allocation in peer-to-peer networks,” in Proc. IEEE Global Internet Symp., 2005.

Min Yang Yuanyuan Yang,”An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing”, IEEE Transactions on computers, Volume: 59, Issue: 9 , page(s): 1158, 2010.

R. H. Wouhaybi and A. T. Campbell, “Phenix: Supporting resilientlow-diameter peer-to-peer topologies,” in Proc. IEEE INFOCOM,2004.

Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and replicationin unstructured peer-to-peer networks,” in International Conference on Supercomputing (ICS‟02). ACM, 2002.

Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal, “Buildinglow-diameter p2p networks,” in IEEE Symposium on Foundations of Computer Science, 2001, pp. 492–499.

M. Zhong, K. Shen, and J. Seiferas, “Non-uniform random membershipmanagement in peer-to-peer networks,” in Proc. IEEE INFOCOM,2005.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.