PChord: a distributed hash table for P2P network

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