Change search
ReferencesLink to record
Permanent link

Direct link
Interaction between Network Partitioning and Churn in a Self-Healing Structured Overlay Network
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS. Catholic University of Louvain (UCL), Louvain-la-Neuve, Belgium .
Catholic University of Louvain (UCL), Louvain-la-Neuve, Belgium .
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
2015 (English)Conference paper (Refereed)
Abstract [en]

We investigate the interaction between Network Partitioning and Churn (node turnover) in Structured Overlay Networks. This work is relevant both to systems with peaks of high stress (e.g., partitions, churn) or continuous high stress. It prepares the way for new application venues in mobile and ad hoc networks, which have high node mobility and intermittent connectivity, and undergo frequent changes in network topology. We evaluate existing overlay maintenance strategies, namely Correction-on-Change, Correction-on-Use, Periodic Stabilization, and Ring Merge. We define the reversibility property of a system as its ability to repair itself to provide its original functionality when the external stress is withdrawn. We propose a new strategy, Knowledge Base, to improve conditions for reversibility in the case of combined network partitioning and churn. By means of simulations, we demonstrate reversibility for overlay networks with high levels of partition and churn and we make general conclusions about the ability of the maintenance strategies to achieve reversibility. We propose a model, namely Stranger Model, to generalize the impact of simultaneous network partitioning and churn. We show that this interaction causes partitions to eventually become strangers to each other, which makes full reversibility impossible when this happens. Using this model, we can predict when irreversibility arrives, which we verify via simulation. However, high levels of one only, network partitioning or churn, do not hinder reversibility. In future work we will extend these results to real systems and experiment with applications that take advantage of reversibility.

Place, publisher, year, edition, pages
IEEE Computer Society, 2015. 232-241 p.
Keyword [en]
Complex systems, Maintenance engineering, Overlay networks, Peer-to-peer computing, Predictive models, Routing, Stress, Network Partition and Churn, Partition Tolerance, Ring Overlay Merge, Structured Overlay Networks
National Category
Computer and Information Science Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-181309DOI: 10.1109/ICPADS.2015.37ScopusID: 2-s2.0-84964620214OAI: oai:DiVA.org:kth-181309DiVA: diva2:898987
Conference
Parallel and Distributed Systems (ICPADS), 2015 IEEE 21st International Conference on
Projects
EMJD-DC
Note

QC 20160418

Available from: 2016-01-30 Created: 2016-01-30 Last updated: 2016-04-18Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Paul, Ruma R.Vlassov, Vladimir
By organisation
Software and Computer systems, SCS
Computer and Information ScienceComputer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 14 hits
ReferencesLink to record
Permanent link

Direct link