BiChord: an improved approach for lookup routing in chord

Authors:
Junjie Jiang;Ruoyu Pan;Changyong Liang;Weinong Wang
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, P.R. China;Institute of Network and System, Hefei University of Technology, Hefei, P.R. China;Institute of Network and System, Hefei University of Technology, Hefei, P.R. China;Network Center, Shanghai Jiaotong University, Shanghai, P.R. China
Venue:
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Year:
2005

Citing 5
Cited 5

A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Wide-area cooperative storage with CFS

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Routing Algorithms for DHTs: Some Open Questions

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Text-Based p2p content search using a hierarchical architecture

ICADL'04 Proceedings of the 7th international Conference on Digital Libraries: international collaboration and cross-fertilization

Self-Chord: A Bio-inspired Algorithm for Structured P2P Systems

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Exploiting power-law node degree distribution in Chord overlays

NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Empowering chord DHT overlays

HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Self-chord: a bio-inspired P2P framework for self-organizing distributed systems

IEEE/ACM Transactions on Networking (TON)
Re-Chord: a self-stabilizing chord overlay network

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient resource lookup is essential for peer to peer networks and DHT (Distributed Hash Table) provides an ideal solution for resource lookup in distributed networks. Chord is a representative peer to peer lookup service based on DHT. The topology of Chord is modeled as a directed graph. There is a unidirectional link from a node to its every routing table entry node. In this paper, we propose to model the topology of Chord as a bidirectional graph. A reverse link is added for each original unidirectional link and such a pair of symmetrical links is maintained by a single heart-beat message. Then each node should maintain a finger table and a reverse finger table at very little additional cost. However, such reverse fingers may help to improve the lookup efficiency greatly. Theoretical analyses and experimental results both approve such improvements.