Greedy routing algorithm is the preferred routing algorithm in structured peer to peer protocols because of its efficiency. However, greedy routing algorithm is designed only for routing performance and not take the load of nodes into consideration. This paper proposed a bias routing algorithm for unlimited-routing-state structured P2P protocols. Not like the traditional greedy routing algorithm, bias routing algorithm will select the next hop dynamically according to the variation of load of nodes and routing performance. Simulation results indicate bias routing algorithm can balance the load better than the traditional greedy routing algorithm under guarantee O（logN） lookup performance, so bias routing algorithm can improve the scalability of structured P2P systems.%由于路由效率高，贪婪式路由算法成为目前基于DHT的结构化P2P协议的首选路由算法，但贪婪式路由算法仅考虑路由效率而忽视了系统中节点负载平衡问题．文章提出一种适用于无状态结构化P2P协议中的偏向路由算法，与传统的路由算法不同的是，偏向路由算法将根据节点间负载变化和路由效率两个方面来动态选择下一跳节点．实验结果表明：与贪婪式路由算法相比，在保证路由效率为0（logN）的前提下，偏向路由算法可使系统内节点负载有更好的平衡，可以提高系统的扩展性能．
展开▼
