2006•Unpublished venueRequires access

AChord: Topology-Aware Chord in Anycast-Enabled Networks

Le Hai Dao, JongWon Kim

Open publisher page 15 citations

Abstract

Chord is a scalable peer-to-peer (P2P) lookup protocol that solves the problem of efficiently locating nodes with designed data items. However, Chord is known to be limited in routing efficiency since all nodes are placed on the overlay without taking into account the underlying network topology. In this paper, we introduce AChord, a topology-aware version of Chord that utilizes anycast, along with additional modifications, to achieve higher routing efficiency. Simutation results show that the proposed approach achieves better performance than the original Chord in the sense of end-to-end lookup latency and average path length.

About this research paper

What this paper is about

Chord is a scalable peer-to-peer (P2P) lookup protocol that solves the problem of efficiently locating nodes with designed data items. However, Chord is known to be limited in routing efficiency since all nodes are placed on the overlay without taking into account the underlying network topology. In this paper, we introduce AChord, a topology-aware version of Chord that utilizes anycast, along with additional modifications, to achieve higher routing efficiency. Simutation results show that the proposed approach achieves better performance than the original Chord in the sense of end-to-end lookup latency and average path length.

Why it matters

OpenAlex reports 15 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Chord is a scalable peer-to-peer (P2P) lookup protocol that solves the problem of efficiently locating nodes with designed data items. However, Chord is known to be limited in routing efficiency since all nodes are placed on the overlay without taking into account the underlying network topology. In this paper, we introduce AChord, a topology-aware version of Chord that utilizes anycast, along with additional modifications, to achieve higher routing efficiency. Simutation results show that the proposed approach achieves better performance than the original Chord in the sense of end-to-end lookup latency and average path length.

Key concepts: Chord (peer-to-peer), Anycast, Computer science, Scalability, Computer network, Pastry, Routing table, Routing protocol

Related papers

Back to paper searchBrowse research topicsOriginal source
AChord: Topology-Aware Chord in Anycast-Enabled Networks — Research Paper | ScholarLens