ScholarLens Back to search
2011•Unpublished venueRequires access

Improvement of Structured P2P Routing Algorithm Based on NN-CHORD

Fan Chao, Hongqi Zhang, Xuehui Du, Chuanfu Zhang

Open publisher page 13 citations

Abstract

In the structured peer-to-peer (P2P) networks, distributed lookup protocol Chord can effectively solve the problem of resource location. However, because the routing table in Chord suffers serious information redundancy and the lookup direction of Chord is only clockwise, it is not very efficient. Therefore, a routing algorithm BNN-Chord (Bidirectional Neighbor's Neighbor Chord) based on NN-Chord (Neighbor's Neighbor Chord) is proposed in this paper. In order to improve lookup efficiency, BNN-Chord adds the coverage and finger density of routing table and repetitious entries are deleted, meanwhile, it introduces bidirectional routing mechanism. Simulation experiments show that our algorithm can remarkably reduce the average lookup path length compared with Chord and can improve system performance.

About this research paper

What this paper is about

In the structured peer-to-peer (P2P) networks, distributed lookup protocol Chord can effectively solve the problem of resource location. However, because the routing table in Chord suffers serious information redundancy and the lookup direction of Chord is only clockwise, it is not very efficient. Therefore, a routing algorithm BNN-Chord (Bidirectional Neighbor's Neighbor Chord) based on NN-Chord (Neighbor's Neighbor Chord) is proposed in this paper. In order to improve lookup efficiency, BNN-Chord adds the coverage and finger density of routing table and repetitious entries are deleted, meanwhile, it introduces bidirectional routing mechanism. Simulation experiments show that our algorithm can remarkably reduce the average lookup path length compared with Chord and can improve system performance.

Why it matters

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

In the structured peer-to-peer (P2P) networks, distributed lookup protocol Chord can effectively solve the problem of resource location. However, because the routing table in Chord suffers serious information redundancy and the lookup direction of Chord is only clockwise, it is not very efficient. Therefore, a routing algorithm BNN-Chord (Bidirectional Neighbor's Neighbor Chord) based on NN-Chord (Neighbor's Neighbor Chord) is proposed in this paper. In order to improve lookup efficiency, BNN-Chord adds the coverage and finger density of routing table and repetitious entries are deleted, meanwhile, it introduces bidirectional routing mechanism. Simulation experiments show that our algorithm can remarkably reduce the average lookup path length compared with Chord and can improve system performance.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Improvement of Structured P2P Routing Algorithm Based on NN-CHORD — Research Paper | ScholarLens