Using bidirectional links to improve peer-to-peer lookup performance |
| |
| Authors: | Jun-jie Jiang Fei-long Tang Feng Pan Wei-nong Wang |
| |
| Affiliation: | (1) Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200030, China;(2) Network Center, Shanghai Jiao Tong University, Shanghai, 200030, China |
| |
| Abstract: | Efficient lookup is essential for peer-to-peer networks and Chord is a representative peer-to-peer lookup scheme based on distributed hash table (DHT). In peer-to-peer networks, each node maintains several unidirectional application layer links to other nodes and forwards lookup messages through such links. This paper proposes use of bidirectional links to improve the lookup performance in Chord. Every original unidirectional link is replaced by a bidirectional link, and accordingly every node becomes an anti-finger of all its finger nodes. Both theoretical analyses and experimental results indicate that these anti-fingers can help improve the lookup performance greatly with very low overhead. |
| |
| Keywords: | Distributed hash table (DHT) Peer-to-peer Lookup performance |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
|
