P2P Model Based on Isolated Broadcast Domains

Jianchun Li, Gongbing Guo, Jianyong Li, Daoying Huang

Coll. of Computer & Communication Eng., Zhengzhou University of Light Industry, Zhengzhou, Henan, China.

DOI: 10.4236/ait.2012.23009                

Abstract

Resource location is the most important issue for Peer-to-Peer (P2P) system and flooding is the fundamental mechanism for unstructured P2P systems. Redundant messages will exponential growth with flooding scope increasing which severely influences the scalability of the system. In this paper, a new P2P model based on isolated broadcast domains is given to reduce the amount of redundant messages by limiting the radius of messages transmitted. Analysis and experiments show that this model can guarantee coverage of nodes and significantly reduce the amount of redundant messages generated.

Keywords

P2P Model; Isolated Broadcast Domains; Redundant Messages

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	A. Prker, “The True Picture of Peer-to-Peer Filesharing,” 2005. http://www.cachelogic.com/resarch/slide9.php
[2]	T. Karagiannis, A. Broido, M. Faloutsos, et al., “Transport Layer Identification of P2P Traffic,” Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement, Taormina, October 2004, pp. 121-134.
[3]	T. Kragiannis, A. Broido, N. Brownlee, et al., “Is P2P Dying or Just Hiding?” Global Telecommunications Conference, Riverside, 29 November-3 December 2004, pp. 1532-1538.
[4]	I. Stoica, et al., “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, San Diego, 27-31 August 2001, pp. 149-160.
[5]	S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker, “A Scalable Content-Addressable Network,” Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, San Diego, August 2001, pp. 161-172.
[6]	A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peerto-Peer Systems,” Proceedings of Middleware 2001, Heidelberg, November 2001.
[7]	Gnutella Website. http://www.gnutella.com
[8]	B. Yang and H. Garica-Molina, “Improving Search in Peer-to-Peer Networks,” International Conference on Distributed Computing, Stanford, 2002, pp. 5-14.
[9]	A. Mihajlo and B. S. Jovanovi’c, “Modeling Large-scale Peer-to-Peer Networks and a Case Study of Gnutella,” University of Cincinnati, Cincinnati, 2000.
[10]	L. A. Adamic, R. M. Lukouse, A. R. Puniyani and B. A. Huberman, “Search in Power-Law Networks,” Physical Review E, Vol. 64, 2001, Article ID 046135. doi:10.1103/PhysRevE.64.046135
[11]	L. A. Adamic, R. M. Lukouse, A. R. Puniyani and B. A. Huberman, “Local Search In Unstructured Networks,” In: S. Bornholdt and H. G. Schuster, Eds., Handbook of Graphs and Networks, Wiely-VCH, Berlin, 2003.
[12]	S. Jiang, L. Guo and X. D. Zhang, “LightFlood: An Efficient Flooding Scheme for File Search in Unstructured Peer-to-Peer Systems,” International Conference on Parallel Processing, Williamsburg, 9 October 2003, pp. 627635.