By Topic

A P2P Overlay Network Routing Algorithm Based on Hierarchy Agglomerative Clustering Topology

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)
Yi Ma ; Software Coll., Northeastern Univ., Shenyang, China ; Guiran Chang ; Zhenhua Tan ; Xueyi Wang

Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. This routing algorithm increases the routing hops and reduces the routing speed. To get better routing efficiency, a new routing algorithm named RHAC based on hierarchy agglomerative clustering was presented in this paper. It dynamically clusters nodes into different clusters based on the communication history information contained in the taxonomy hierarchy, and organizes the clusters into routing overlays, thus forming a hierarchy - based P2P network topology subspace. By this algorithm the nodes involved and messages to send are reduced and the network performance is greatly enhanced. Preliminary evaluation shows that RHAC achieves a good convergence on a large scale of nodes.

Published in:

Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on

Date of Conference:

13-15 Dec. 2010