Title: LH*RSP2P: a fast and high churn resistant scalable distributed data structure for P2P systems

Authors: Hanafi Yakouben, Sahri Soror

Addresses: CERIA Lab, Universite Paris-Dauphine, Place Marechal de Lattre de Tassigny, 75016 Paris Cedex, France. ' CERIA Lab, Universite Paris-Dauphine, Place Marechal de Lattre de Tassigny, 75016 Paris Cedex, France

Abstract: LH*RSP2P is a new scalable distributed data structure (SDDS) for P2P applications. It deals with two major issues in P2P systems. One is efficient location of the peers with searched data records. The other is the protection against data unavailability due to churn of peers. The LH*RSP2P properties permit to reduce key search messaging to at most one forwarding message (hop). It is also the least number of worst case hops for any SDDS known at present and likely the least possible. The scheme provides in fact the fastest key search for any known SDDS. Also, a scan of the file requires at most two rounds. To deal efficiently with churn, LH*RSP2P parity management principles. As the result, the file transparently supports unavailability or withdrawal of up to any k ≥ 1 peers, where k is a parameter that can scale dynamically with the file.

Keywords: scalable data structures; distributed data structures; SDDS; P2P system; linear hashing; peer-to-peer; data unavailability; peers location.

DOI: 10.1504/IJITST.2010.031470

International Journal of Internet Technology and Secured Transactions, 2010 Vol.2 No.1/2, pp.5 - 31

Published online: 05 Feb 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article