Skip to Main Content
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.