By Topic

High Coverage Search in Multi-Tree Based P2P Overlay Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Cuihua Zuo ; Coll. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Ruixuan Li ; Haiying Shen ; Zhengding Lu

The blind flooding algorithm under a time-to-live (TTL) constraint used in unstructured peer-to-peer (P2P) networks, such as Gnutella, may cause a large amount of network traffic. The algorithm cannot guarantee for acquiring the required data objects, especially for rare ones. To mitigate these problems, this paper proposes PercolationNET, a multi-tree sub-overlay, which is built on top of an existing P2P overlay (named original overlay). PercolationNET organizes peers in a tree-based structure which facilitates reliable and efficient message dissemination for search. The search process is divided into two stages. A query message is first propagated on the original overlay, and then broadcast along the sub-overlay PercolationNET. PercolationNET combines the advantages of fast coverage speed in flooding-based scheme and low traffic cost in tree-based scheme. The experimental results of PercolationNET compared with FloodNet confirm the superiority of PercolationNET in achieving faster coverage speed and lower message cost.

Published in:

Computer Communications and Networks, 2009. ICCCN 2009. Proceedings of 18th Internatonal Conference on

Date of Conference:

3-6 Aug. 2009