Cart (Loading....) | Create Account
Close category search window
 

Key-peers based topology control for unstructured P2P networks

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

3 Author(s)
Cuihua Zuo ; Dept. of Comput. & Inf. Eng., Wuhan Polytech. Univ., Wuhan, China ; Hongcai Feng ; Cao Yuan

One of the essential problems in unstructured peer-to-peer (P2P) network is enhancing the efficiency of resource retrieval. Previous researches either have poor response speed, or generate too much network overhead. In order to reduce the traffic load and improve the availability of the sharing resources in unstructured P2P networks, a key-peers based topology control mechanism is presented in this paper. Due to inherent heterogeneity of peers in P2P network, a few peers (called key-peers) directly affect the connectivity of P2P overlay topology. Therefore, it is particularly important to explore these peers. Here, we regard P2P overlay topology as an undirected graph, and analyze the similarities and differences between cut-nodes in graph theory and key-peers in P2P networks. Then we use the related principles about cut-nodes and the reachability relationship of nodes to detect the key-peers of P2P network. Furthermore, we adjust P2P overlay topology based on these key-peers. Finally, experimental results show that compared to the original P2P overlay topology, the modified topology using our approach can perform much better in success rate and respond speed, especially for rare resources.

Published in:

Future Computer and Communication (ICFCC), 2010 2nd International Conference on  (Volume:3 )

Date of Conference:

21-24 May 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.