New Peer-to-Peer Overlay Network Routing Algorithm RGAAC
TAN Zhenhua - · Journal of Chinese Computer Systems · 2009
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.A new routing algorithm named RGAAC based on group-average agglomerative clustering was presented.Structured by k clusters topology,this p2p network has k cluster center nodes which record the routing information.According to this routing information,the node will choose the nearest node which has the least routing hops.Conclusions show that RGAAC reduces the routing hops and increases the performance in routing efficiency.