LH*_RS^P2P: a fast and high churn resistant scalable distributed data structure for P2P systems
by Hanafi Yakouben, Sahri Soror
International Journal of Internet Technology and Secured Transactions (IJITST), Vol. 2, No. 1/2, 2010

Abstract: 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.

Online publication date: Fri, 05-Feb-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Technology and Secured Transactions (IJITST):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com