P-Chord:an Partition-Based Routing Model for Chord
Biqing Wang
Abstract
Biqing Wang
Abstract
In P2P network, a fundamental problem that confronts peer-to-peer application is to efficiently locate the node that stores a particulat data item.The routing table in Chord suffers serious information redundancy and affects the efficiency of the system. So, an partition-based routing model for Chord (P-Chord) is proposed. By partition, the routing table of nodes are improved to depress information redundancy and gain more useful information. Simulation experiments show that P-Chord reduces the average lookup path length and gets higher efficiency under the condition of keeping other Chord performance.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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 P2P network, a fundamental problem that confronts peer-to-peer application is to efficiently locate the node that stores a particulat data item.The routing table in Chord suffers serious information redundancy and affects the efficiency of the system. So, an partition-based routing model for Chord (P-Chord) is proposed. By partition, the routing table of nodes are improved to depress information redundancy and gain more useful information. Simulation experiments show that P-Chord reduces the average lookup path length and gets higher efficiency under the condition of keeping other Chord performance.
Key concepts: Chord (peer-to-peer), Computer science, Routing table, Static routing, Redundancy (engineering), Computer network, Routing algorithm, Distributed computing