A Peer-to-Peer Overlay Network Routing Algorithm Based on Multiple Circle Topology

The routing algorithm of randomly selecting neighbor nodes is mostly used in P2P applications,which decreases the routing efficiency and increases the routing hops.To solve this problem,a new routing algorithm named RMCT based on multiple circle topology was presented.Nodes were dynamically divided into a number of clusters which used sub-supernodes to manage.A short routing table based on constant grade was defined.In RMCT,maintaining the route table for nodes entering/exiting were presented,as well as the clusters building method and distributed election algorithm for sub-supernodes.Compared to the performance of such typical algorithms as Chord,the RMCT algorithm greatly improved the performance in regard to routing table maintaining,routing hops,and network delay.Simulations and analysis results showed that the RMCT was an efficient routing algorithm though some problems were to be studied further.