2006•Journal of Computer ApplicationsRequires access

Improvement of Chord routing algorithm

Jianzhong Li

Abstract

Routing is essential in P2P applications, and it is very important to locate the nodes that contain given data items. Chord is a successful routing algorithm, but the routing table in Chord has a terrible problem of information redundancy. To address this problem, an improved Chord algorithm was proposed which inherited the advantages of Chord, such as simplicity, efficiency, reliability, load balance and low cost. The routing table was improved to gain more useful information and get higher efficiency.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5 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

Key concepts: Chord (peer-to-peer), Computer science, Routing table, Static routing, Destination-Sequenced Distance Vector routing, Multipath routing, Link-state routing protocol, Redundancy (engineering)