2007•Journal of Chinese Computer SystemsRequires access

RCchord6: Resource-considered Chord in IPv6

Jinsheng Li

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Computer science, Pastry, Distributed hash table, Chord (peer-to-peer), Peer-to-peer, Distributed computing, Hash table, Resource consumption

Related papers

Back to paper searchBrowse research topicsOriginal source
RCchord6: Resource-considered Chord in IPv6 — Research Paper | ScholarLens