By Topic

A Clustering Route Algorithm of P2P Networks based on Knödel Graph

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)
Shi Chang Qiong ; Inst. of Comput. & Commun. Eng., Changsha Univ. of Sci. & Technol., Changsha, China ; Wang Da Wei ; Huang Hui ; Huang Yuanyuan

A new clustering route algorithm of p2p networks based on knodel graph is proposed in this paper. According to the primary method, our algorithm added physical clustering in ordering to create relation between node's physical position and logical id number can improve the route efficiency of the whole knodel p2p network.

Published in:

2009 International Conference on Signal Processing Systems

Date of Conference:

15-17 May 2009