An Improved P2P Network Routing Algorithm Based on ISODATA Clustering Taxonomy Topology

摘要

In P2P applications, any distributed peers which make a portion of their resources directly available to other peers, without the need for central coordination instances. 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, an improved routing algorithm named RIDC was presented in this paper. It dynamically clusters nodes into different clusters in a taxonomy hierarchy, and organizes the clusters into routing overlays. By this algorithm the nodes involved and messages to send are reduced and the network performance is greatly enhanced. Preliminary evaluation shows that RIDC achieves a good convergence on a large scale of nodes.