A New P2P Network Routing Algorithm Based on ISODATA Clustering Topology

摘要

Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. These routing algorithms increase the routing hops. To get better routing efficiency, a new routing algorithm named RIDC was presented in this paper. It dynamically merges nodes into different clusters in a taxonomy hierarchy, and organizes the clusters into routing overlays. By this algorithm the network performance is greatly enhanced. Preliminary evaluation shows that RIDC achieves a good convergence on a large scale of nodes.