Chord routing algorithm based on limited multicasting
Jinlin Wang
Abstract
Jinlin Wang
Abstract
Chord is a successful routing algorithm,but the inconsistence between logistic routing and physical routing leads to a very big network delay if the node routing only relies on logistic distance and this will seriously affect the routing efficiency.A Chord routing algorithm based on limited network layer multicasting was proposed,which used multicast technology to obtain physical neighbor nodes and improved on original Chord routing algorithm.It can shorten network search delay greatly,reduce routing hops effectively and improve the performance of routing.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Chord is a successful routing algorithm,but the inconsistence between logistic routing and physical routing leads to a very big network delay if the node routing only relies on logistic distance and this will seriously affect the routing efficiency.A Chord routing algorithm based on limited network layer multicasting was proposed,which used multicast technology to obtain physical neighbor nodes and improved on original Chord routing algorithm.It can shorten network search delay greatly,reduce routing hops effectively and improve the performance of routing.
Key concepts: Computer science, Static routing, Computer network, Dynamic Source Routing, Destination-Sequenced Distance Vector routing, Link-state routing protocol, Policy-based routing, Multipath routing