Paper Title:
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.

  Info
Periodical
Key Engineering Materials (Volumes 439-440)
Edited by
Yanwen Wu
Pages
865-869
DOI
10.4028/www.scientific.net/KEM.439-440.865
Citation
M. Zhang, J. Q. Yang, "An Efficient Searching Scheme in Unstructured P2P Networks", Key Engineering Materials, Vols. 439-440, pp. 865-869, 2010
Online since
June 2010
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Ming Zhang, Jin Qiu Yang
Abstract:Structured peer-to-peer (P2P) systems are creating a large proportion of network traffic in today’s Internet. Peer-to-peer systems enable...
870
Authors: Jing Feng Yan, Shao Hua Tao
Abstract:since the nodes of P2P network always join or exit dynamically, web-based P2P search technology is much more complicated than the traditional...
393
Authors: Ya Dong Gong, Yong Xiang Wen, He Ping Deng, Zhan Ran Gu
Chapter 6: Surface Technology
Abstract:Although the original intent of the peer-to-peer (P2P) concept is to treat each participant equally, the heterogeneity is an inherent...
1945