Peer-to-Peer (P2P) networks, including flat and two-layer super-peer implementations are extremely popular nowadays due to their simplicity, ease of deployment and versatility. The p2p network contains many cyclic paths which introduce numerous duplicate messages in the system. While such messages can be identified and ignored, they still consume a large proportion of the bandwidth and other resources, causing bottlenecks in the entire network.
In this paper We describe DCMP,a dynamic ,fully decentralized protocol which reduces significantly the duplicate messages by eliminating unnecessary cycles. As queries are transmitted through the peers ,DCMP identifies the paths to break the cycles, while maintaining the connectivity of the network. With the information collected during this process distributed maintenance is performed efficiently even if peers quit the system without notification.DCMP can be easily implemented in various existing P2P systems.
C.Santhiya : Information Technology, Anna University, Thaigarajar College of engineering
Madurai, Tamil Nadu, 625017, India
T.Manju : Information Technology, Anna University, Thaigarajar College of engineering
Madurai, Tamil Nadu, 625017, India
Network protocols; distributed systems; p2p
In this paper DCMP is described, a protocol for distributed cycle minimization in broadcast-based P2P systems. It preserves low diameter while eliminating most of the duplicate messages. The overhead due to control messages is minimal. This results in reduced response time, which in turn increases the scalability. The protocol is suitable for dynamic networks, since it handles peer joins/departures efficiently and is resilient to failures. DCMP is also designed to be as simple as possible and is independent of the search algorithm. Therefore, it can be implemented on the top of popular P2P systems. A prototype implementation is used to verify that this techniques are applicable to realistic environments.
[1] S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. “a Scalable Content-Addressable Network,” in Proc. of ACM SIGCOMM,2001pp.161-172.
[2] I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F 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.
[3] Gnutella, http://www.gnutella.com/ and
http://groups.yahoo.com/group/the gdf/.
[4] Kazza, http://www.kazaa.com/.
[5] M. Ripeanu, A. Iamnitchi, and I. T. Foster, “Mapping the Gntella Network”,IEEE Internet Computing vol6,no1,pp 50-57,2002.
[6] Q. Lv, P. Cao, E. Cohen, K. Li,and S. Shenker, “Search and Replication in Unstructured Peer-to- peer networks”, in Proc. of Int. Conf. on
Supercomputing (ICS), 2002, pp. 84-95.
[7] PlanetLab, http://www.planet-lab.org/.
[8] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, Shenker, “Making Gnutella-Like P2P Systems Scalable,” in Proc. of ACM SIGCOMM,2003,PP.407-418.
[9] S. Androutsellis-Theotokis and D. Spinellis, “A Survey of Peer-to-Peer Content Distribution Technologies,” ACM Computing Surveys, vol. 36, no. 4, pp. 335-371, 2004.
[10] V. Cholvi, P.A. Felber, and E.W. Biersack, “Efficient Search in Unstructured Peer-to-Peer Networks,” European Trans. Telecomm., vol. 15, no. 6, 2004.
