PChord: a distributed hash table for P2P network

Front. Electr. Electron. Eng. ›› 2010, Vol. 5 ›› Issue (1) : 49 -58.

PDF (224KB)
Front. Electr. Electron. Eng. ›› 2010, Vol. 5 ›› Issue (1) : 49 -58. DOI: 10.1007/s11460-009-0068-0
Research articles
Research articles

PChord: a distributed hash table for P2P network

Author information +
History +
PDF (224KB)

Abstract

As a solution for data storage and information sharing for peer-to-peer (P2P) networks, a novel distributed hash table (DHT) structure called PChord is presented in this paper. PChord adopts a bi-directional searching mechanism superior to Chord and enhances the structure of the finger table. Based on Hilbert space filling curve, PChord realizes the mapping mechanism for multi-keyword approximate searching. Compared with the Chord and Kademlia protocols, PChord evidently increases speed on resource searching and message spreading via theoretic proof and simulation results, while maintaining satisfactory load balance.

Keywords

distributed hash table (DHT) / peer-to-peer (P2P) / bi-directional searching

Cite this article

Download citation ▾
null. PChord: a distributed hash table for P2P network. Front. Electr. Electron. Eng., 2010, 5(1): 49-58 DOI:10.1007/s11460-009-0068-0

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (224KB)

1243

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/