RCchord6: Resource-considered Chord in IPv6
Jinsheng Li
Abstract
Jinsheng Li
Abstract
In P2P (Peer-to-Peer) systems, it's a hot point to locate the node that stores the desired data item efficiently. To address the problem, several research groups independently proposed structured P2P systems based on DHT (distributed hash table), which include Chord, CAN, Pastry and Tapestry. But all of these systems didn't take into account the different resource of nodes such as bandwidth and CPU processing data ability. This paper proposed a 2-layer structured P2P model taking into account resource of nodes and physical network topology based on IPv6. The main idea of this method is to separate the p2p network into several domains and use domain representative nodes to reduce communication probability between two low-resource nodes from different domains. Simulation results show that this method can reduce the query delay and improve the performance well.
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 P2P (Peer-to-Peer) systems, it's a hot point to locate the node that stores the desired data item efficiently. To address the problem, several research groups independently proposed structured P2P systems based on DHT (distributed hash table), which include Chord, CAN, Pastry and Tapestry. But all of these systems didn't take into account the different resource of nodes such as bandwidth and CPU processing data ability. This paper proposed a 2-layer structured P2P model taking into account resource of nodes and physical network topology based on IPv6. The main idea of this method is to separate the p2p network into several domains and use domain representative nodes to reduce communication probability between two low-resource nodes from different domains. Simulation results show that this method can reduce the query delay and improve the performance well.
Key concepts: Computer science, Pastry, Distributed hash table, Chord (peer-to-peer), Peer-to-peer, Distributed computing, Hash table, Resource consumption