| Using bidirectional links to improve peer-to-peer lookup performance |
| |
| 引用本文： | JIANG Jun-jie TANG Fei-long PAN Feng WANG Wei-nong. Using bidirectional links to improve peer-to-peer lookup performance[J]. 浙江大学学报(A卷英文版), 2006, 7(6): 945-951. DOI: 10.1631/jzus.2006.A0945 |
| |
| 作者姓名： | JIANG Jun-jie TANG Fei-long PAN Feng WANG Wei-nong |
| |
| 作者单位： | JIANG Jun-jie1，TANG Fei-long1，PAN Feng1，WANG Wei-nong2 (1Department of Computer Science and Engineering，Shanghai Jiao Tong University，Shanghai 200030，China) (2Network Center，Shanghai Jiao Tong University，Shanghai 200030，China) |
| |
| 摘 要： | INTRODUCTION Peer-to-peer computing has become a populardistributed computing paradigm. Efficient resourcelookup is essential for such systems. As we know, most of the deployed peer-to-peersystems are unstructured. Napster is based on a cen-tral directory and was in popular use during early daysSoon after, Gnutella and KaZaA were deployedwidely. However, all these popular unstructuredpeer-to-peer systems suffer from unscalability. Fortunately, there are new kinds of peer-to-peernetwor…
|
| 关 键 词： | 分布式哈希表 DHT 查找性能 双向边线 |
| 收稿时间： | 2005-03-09 |
| 修稿时间： | 2005-05-27 |
Using bidirectional links to improve peer-to-peer lookup performance |
| |
| Jun-jie Jiang,Fei-long Tang,Feng Pan,Wei-nong Wang. Using bidirectional links to improve peer-to-peer lookup performance[J]. Journal of Zhejiang University Science, 2006, 7(6): 945-951. DOI: 10.1631/jzus.2006.A0945 |
| |
| 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 等数据库收录！ |
