An Efficient Searching Scheme in Unstructured P2P Networks

Abstract:

Unstructured peer-to-peer (P2P) systems，due to their excellent support for content lookup and sharing，are creating a large proportion of network traffic in today’s Internet. A P2P system typically involves thousands or millions of live peers in the network. In this paper, we propose and evaluate an efficient searching scheme in unstructured P2P networks. This scheme proposes a local adaptive routing protocol. This routing protocol adopts a simple scheme which driven by query interest among peers. We analyze this scheme’s performance and present simulation results. Our simulation results demonstrated the benefits of the proposed system and show that the approach is able to dynamically group nodes in clusters containing peers with shared interests, at the same time, and organized into a community network.

• Periodical: Key Engineering Materials (Volumes 439-440)
• Pages: 865-869
• DOI: https://doi.org/10.4028/www.scientific.net/KEM.439-440.865
• Online since: June 2010
• Authors: Ming Zhang, Jin Qiu Yang
• Keywords: Community, Peer-to-Peer (P2P), Routing Algorithm, Search, Unstructured Topology

References

[1] Xiuqi Li and Jie Wu A Hybrid Searching Scheme in Unstructured P2P Networks" Proceedings of the 2005 International Conference on Parallel Processing (ICPP, 05) 0190-3918/05 $20. 00. 2005 IEEE.

DOI: 10.1109/icpp.2005.8

[2] Luca Gatani, Giuseppe Lo Re, Alfonso Urso, and Salvatore Gaglio Reinforcement Learning for P2P Searching" Proceedings of the Seventh International Workshop on Computer Architecture for Machine Perception (CAMP, 05) 0-7695-2255-6/05. 2005 IEEE.

DOI: 10.1109/camp.2005.45

[3] Q. Lv, P. Caoa, E. Cohen, K. Li, and S. Shenker, Search and replication in unstructured Peer-to-Peer networks, in Proc. ACM ICS, June (2002).

DOI: 10.1145/511334.511369

[4] I. Stoica, R. Morris, D. Karger, and M. F. Kaashoek, Chord: A scalable Peer-to-Peer lookup service for internet applications, in Proc. ACM SIGCOMM 01, Aug. 2001, pp.149-160.

DOI: 10.1145/964723.383071

[5] A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale Peer-to-Peer systems, in Proc. of the IFIP/ACM International Conference on Distributed Systems Platforms, Nov. (2001).

DOI: 10.1007/3-540-45518-3_18

[6] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content-addressable network, in Proc. ACM SIGCOMM 01, Aug. 2001, pp.161-172.

DOI: 10.1145/964723.383072

[7] Limewire. The Gnutella protocol specification(ver. 0. 4). [Online]. Available: http: /www. limewire. com/developer/gnutella protocol 0. 4. pdf.

[8] M. Ripeanu, I. Foster, and A. Iamnitchi, Mapping the Gnutella network: Properties of large scale Peer-to-Peer systems and implications for system design, IEEE Journal on Internet Computing, Special Issue on Peer-to-peer Networking, (2002).

DOI: 10.1007/3-540-45748-8_8

[9] L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, Search in power law networks, Phys. Rev. E64, pp.46-143, (2001).

DOI: 10.1103/physreve.64.046135