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...
详细信息
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. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of [CEIS 2011]
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...
详细信息
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.
暂无评论