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

• Authors: Hanafi Yakouben;Sahri Soror
• Venue: International Journal of Internet Technology and Secured Transactions
• Year: 2010

LH*_{RS^P2P 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*RS^P2P 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*RS^P2P 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.}