Scalable merger of chord-rings

Authors:
Zoltan Lajos Kis;Robert Szabo
Affiliations:
Ericsson Telecommunications Hungary, Budapest, Hungary.;Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary
Venue:
International Journal of Communication Networks and Distributed Systems
Year:
2010

Citing 6
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Canon in G Major: Designing DHTs with Hierarchical Structure

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Adapting Distributed Hash Tables for Mobile Ad Hoc Networks

PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
The challenges of merging two similar structured overlays: a tale of two networks

IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems

Quantified Score

Hi-index	0.00

Visualization

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.