IEEE Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice

These are the authors' versions of the work. The copyright is with ACM. They are posted here by permission of ACM for your personal use. Not for redistribution. See individual publication details for information on the publication of the definitive versions.

Springer-Verlag LNCS Copyright Notice

The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.

Work that appeared before the 1st of September 2003 was published while the authors were with the Lehrstuhl Praktische Informatik IV at the University of Mannheim.

A Tale of Many Networks: Splitting and Merging of Chord-like Overlays in Partitioned Networks

Author(s): Tobias Amft, Kalman Graffi.
Title: A Tale of Many Networks: Splitting and Merging of Chord-like Overlays in Partitioned Networks
Published: Technical Report TR-2017-001, Technology of Social Networks Group, Heinrich Heine University, Düsseldorf, Germany, September 2017
Abstract: Peer-to-peer overlays define an approach to operatedata management platforms, which are robust against censorshipattempts from countries or large enterprises. The robustnessof such overlays is endangered in the presence of nationalInternet isolations, such as it was the case in recent years duringpolitical revolutions. In this paper, we focus on splits and, withstronger emphasis, on the merging of ring-based overlays inthe presence of network partitioning in the underlying Internetdue to various reasons. We present a new merging algorithmnamed Ring Reunion Algorithm and point out how to reducethe amount of messages both in separated and united overlaystates. The algorithm is parallelized for an accelerated mergingand able to automatically detect overlay partitioning and tostart corresponding merging processes. We evaluated throughsimulations the new Ring Reunion Algorithm in its simple andparallelized form in comparison to plain Chord, Chord-Zip andtwo versions of the Ring Unification Algorithm. Evaluation showsthat only our parallelized Ring Reunion Algorithm allows tomerge two, three and more isolated overlay networks in parallel.Our approach quickly merges the overlays, even under churn,and stabilizes the node contacts in the overlay with small trafficoverhead.
Bib entry: [XML] [BibTeX]
Download: [PDF]
Responsible for the content: E-MailWE Informatik