Title: Scalable merger of chord-rings

Authors: Zoltan Lajos Kis, Robert Szabo

Addresses: Ericsson Telecommunications Hungary, Budapest, Hungary. ' Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary

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.

Keywords: distributed hash tables; DHT; distributed processing; network composition; overlay networks; chord rings; chord-zip algorithm.

DOI: 10.1504/IJCNDS.2010.033160

International Journal of Communication Networks and Distributed Systems, 2010 Vol.4 No.4, pp.376 - 388

Received: 17 Mar 2009
Accepted: 20 Jun 2009
Published online: 10 May 2010 *

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