Paper Info
Title
BiChord: an improved approach for lookup routing in chord
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.
Year
DOI
Venue
2005
10.1007/11547686_25
ADBIS
Keywords
Field
DocType
lookup routing,original unidirectional link,lookup service,improved approach,reverse link,finger table,reverse finger table,resource lookup,routing table entry node,reverse finger,lookup efficiency,efficient resource lookup,distributed hash table,directed graph
Pastry,Computer science,Computer network,Directed graph,Hash function,Routing table,Chord (music),Koorde,Database,Distributed hash table,Chord (peer-to-peer),Distributed computing
Conference
Volume
ISSN
ISBN
3631
0302-9743
3-540-28585-7
Citations 
PageRank 
References 
13
0.90
5
Authors
4
Name
Order
Citations
PageRank
Junjie Jiang1152.76
Ruoyu Pan2130.90
Chang-Yong Liang327520.92
Weinong Wang4279.74