Peer-to-Peer routing model based on Chord
Zhang Zhen-yu
Abstract
Zhang Zhen-yu
Abstract
In view of the inconsistence between logical topology and physical topology,and neglect of the heterogeneity of nodes,a new Peer-to-Peer (P2P) routing model based on Chord was proposed.Using address aggregation of IPv6 and hashing node's IP partly,it got hierarchy node's identifier and achieved topological consistency.According to the size of the network,it mapped nodes to multi-layer Chord rings,so that nodes in the same aggregation could domain themselves.Considering the heterogeneity of nodes,well-behaved nodes were assigned more routing tasks.The simulation results show that the proposed model can keep an average routing hops length similar to Chord,but reduce storage cost and search delay.
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.
In view of the inconsistence between logical topology and physical topology,and neglect of the heterogeneity of nodes,a new Peer-to-Peer (P2P) routing model based on Chord was proposed.Using address aggregation of IPv6 and hashing node's IP partly,it got hierarchy node's identifier and achieved topological consistency.According to the size of the network,it mapped nodes to multi-layer Chord rings,so that nodes in the same aggregation could domain themselves.Considering the heterogeneity of nodes,well-behaved nodes were assigned more routing tasks.The simulation results show that the proposed model can keep an average routing hops length similar to Chord,but reduce storage cost and search delay.
Key concepts: Chord (peer-to-peer), Computer science, Computer network, Routing table, Pastry, Routing protocol, Distributed computing, Topology (electrical circuits)