Scalable merger of chord-rings
by Zoltan Lajos Kis, Robert Szabo
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 4, No. 4, 2010

Abstract: In our previous work, we investigated how distributed hash tables – specifically chord-rings – can be merged in an efficient manner, thereby, supporting compositions of dynamic networks relying on DHTs as management substrates. As a result, we presented the chord-zip algorithm. In this paper, we present our investigations and findings on how the chord-zip algorithm can be parallelised in order to achieve scalability in the merger of chord-rings.

Online publication date: Mon, 10-May-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 Communication Networks and Distributed Systems (IJCNDS):
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