3,712 Hits in 5.7 sec

Self-stabilization Overhead: an Experimental Case Study on Coded Atomic Storage [article]

Chryssis Georgiou, Robert Gustafsson, Andreas Lindhe, Elad M. Schiller
2018 arXiv   pre-print
So, one would wonder whether the overhead introduced by self-stabilization would nullify the gain of erasure coding.  ...  As one would expect, self-stabilization does not come as a free lunch; it introduces, mainly, communication overhead for detecting inconsistencies and stale information.  ...  Our Contribution We are the first to implement and evaluate via experiments a self-stabilizing algorithm for coded atomic MWMR shared memory emulation [10] .  ... 
arXiv:1807.07901v2 fatcat:5byqrpcw3zfdvmum3bg5xsmt7i

Technical Report: Benefits of Stabilization versus Rollback in Self-Stabilizing Graph-Based Applications on Eventually Consistent Key-Value Stores [article]

Duong Nguyen, Sandeep S. Kulkarni
2020 arXiv   pre-print
In this paper, we evaluate and compare the performance of two approaches, namely self-stabilization and rollback, to handling consistency violating faults (\cvf) that occur when a self-stabilizing distributed  ...  One way to deal with these faults is to utilize rollback whereas another way is to rely on the property of self-stabilization that is expected to provide recovery from arbitrary states.  ...  In general, stabilization performed better than rollback in our case studies.  ... 
arXiv:2007.14218v1 fatcat:goimfvvuefczdn74ldxb7kohpm

Self-Stabilizing Snapshot Objects for Asynchronous Fail-Prone Network Systems [article]

Chryssis Georgiou, Oskar Lundström, Elad Michael Schiller
2020 arXiv   pre-print
A snapshot object simulates the behavior of an array of single-writer/multi-reader shared registers that can be read atomically.  ...  We aim at the design of even more robust snapshot objects via the lenses of self-stabilizationa very strong notion of fault-tolerance. In addition to Delporte-Gallet et al.'  ...  Self-stabilizing algorithm for non-blocking snapshot object; code for p i . The boxed code lines mark the added code to Algorithm 1.  ... 
arXiv:1906.06420v2 fatcat:r4jihlmsf5bxjm4mtj3qo5eqgi

Renaissance: Self-Stabilizing Distributed SDN Control Plane [article]

Marco Canini, Elad Michael Schiller Université catholique de Louvain, University of Vienna
2019 arXiv   pre-print
We evaluate Renaissance through a rigorous worst-case analysis as well as a prototype implementation (based on OVS and Floodlight), and we report on our experiments using Mininet.  ...  This paper considers the design of dependable SDNs through the lenses of self-stabilization - a very strong notion of fault-tolerance.  ...  Algorithm 1: Self-stabilizing SDN, high-level code description for controller pi.  ... 
arXiv:1712.07697v2 fatcat:hsb72g23gvhyzdyxd2prpzrksm

Architectural Stability Reasoning using Self-Awareness Principles: Case of Self-Adaptive Cloud Architectures [article]

Maria Salama, Rami Bahsoon, Rajkumar Buyya
2019 arXiv   pre-print
In this paper, we present a framework for reasoning about stability during runtime, leveraging on self-awareness principles.  ...  With the increased dependence on software, there is a pressing need for engineering long-lived software.  ...  Acknowledgments We would like to thank Abdessalam Elhabbash for useful discussions on selfawareness, Rafik Salama for online learning inspiration, and David Parker for the support on PRISM-games.  ... 
arXiv:1912.06469v1 fatcat:jcvgtsclszdafdcmfimadnsqpu

Self-Stabilizing Indulgent Zero-degrading Binary Consensus [article]

Oskar Lundström and Michel Raynal and Elad Michael Schiller
2020 arXiv   pre-print
We do so through the lenses of self-stabilization - a very strong notion of fault-tolerance.  ...  Since the proposed solution uses an Ω failure detector, we also present the first, to the best of our knowledge, self-stabilizing asynchronous Ω failure detector, which is a variation on the one by Mostéfaoui  ...  Conclusions We showed how a non-self-stabilizing algorithm for indulgent zero-degrading binary consensus by Guerraoui and Raynal [25] can be transformed into one that can recover after the occurrence  ... 
arXiv:2010.05489v1 fatcat:jyjr2hvx65bahclzf3zwywjqhm

Construction of connected dominating sets in large-scale MANETs exploiting self-stabilization

Stefan Unterschutz, Volker Turau
2011 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)  
This work introduces and evaluates a new local, probabilistic self-stabilizing algorithm providing fault-tolerance and scalability for networks of high density.  ...  Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity.  ...  Furthermore, ensuring atomicity of the program execution in a large-scale network introduces a very high controlling overhead.  ... 
doi:10.1109/dcoss.2011.5982201 dblp:conf/dcoss/UnterschutzT11 fatcat:zlblulsy45hdtijpib34qttad4

Benefit of Self-Stabilizing Protocols in Eventually Consistent Key-Value Stores: A Case Study [article]

Duong Nguyen, Sandeep S. Kulkarni, Ajoy K. Datta
2018 arXiv   pre-print
In this paper, we focus on the implementation of distributed programs in using a key-value store where the state of the nodes is stored in a replicated and partitioned data store to improve performance  ...  We argue that these applications should be designed to be stabilizing so that they recover from an arbitrary state to a legitimate state.  ...  A self-stabilizing program [17] guarantees that starting from an arbitrary state, in finite time, the program recovers to a legitimate state.  ... 
arXiv:1808.00822v2 fatcat:3okxywxtsvdo7fcw5eznved5zy

CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system [article]

Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler
2013 arXiv   pre-print
We consider the problem of managing a dynamic heterogeneous storage system in a distributed way so that the amount of data assigned to a host in that system is related to its capacity.  ...  We present distributed protocols for these problems that are self-stabilizing and that do not need any global knowledge about the system such as the number of nodes or the overall capacity of the system  ...  complexity and information storage and moreover works in a self-stabilizing manner.  ... 
arXiv:1307.6747v1 fatcat:gnzf33oahne4tcj7fg7bmgabla

A Fault-Local Self-Stabilizing Clustering Service for Wireless Ad Hoc Networks

M. Demirbas, A. Arora, V. Mittal, V. Kulathumani
2006 IEEE Transactions on Parallel and Distributed Systems  
2, FLOC achieves locality of clustering and fault-local self-stabilization: The effects of cluster formation and faults/changes at any part of the network are contained within at most m þ 1 units.  ...  For information on obtaining reprints of this article, please send e-mail to:, and reference IEEECS Log Number TPDSSI-0171-0205.  ...  A self-stabilizing program is faultlocal self-stabilizing if the time and number of messages required for stabilization are bounded by functions of perturbation size rather than network size.  ... 
doi:10.1109/tpds.2006.113 fatcat:p6slyp4qavgkpkg72mrhv3b2ky

Secure and self-stabilizing clock synchronization in sensor networks

Jaap-Henk Hoepman, Andreas Larsson, Elad M. Schiller, Philippas Tsigas
2011 Theoretical Computer Science  
The algorithm is self-stabilizing, so if these bounds are temporarily violated, the system can efficiently stabilize back to a correct state.  ...  Using this clock sampling algorithm, we construct the first self-stabilizing algorithm for secure clock synchronization in sensor networks that is resilient to the aforementioned adversarial attacks.  ...  Secure and self-stabilizing native clock sampling algorithm (code for p i ∈ P). every step can be associated with at most one communication operation.  ... 
doi:10.1016/j.tcs.2010.04.012 fatcat:b27brqdzrzhg7a3wjphn6sgbgy

Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative

Lélia Blin, Sébastien Tixeuil
2017 Distributed computing  
This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem.  ...  We present a new deterministic (nonsilent) self-stabilizing protocol for n-node rings that uses only O(log log n) memory bits per node, and stabilizes in O(n log 2 n) rounds.  ...  While stabilization time is meaningful to evaluate the efficiency of an algorithm in the presence of failures, it does not necessarily capture the overhead of self-stabilization when there are no faults  ... 
doi:10.1007/s00446-017-0294-2 fatcat:kiyqxzz7hbhtnmlz3wvm25ute4

Uncertainties in Risk Estimations of Electromagnetic Fields of Overhead Power Lines

A de Jong, J P. van der Sluijs, J A. Wardekker
2009 Epidemiology  
Methods: We used mortality data from 106 cities in the US NMMAPS study (years 1987-2000).  ...  We examined the association between temperature and mortality using Poisson regression and fitted a non-linear spline for temperature.  ...  In the context of the Rome Longitudinal Study (RoLS), we analyzed the association between residential road traffic noise and prescriptions for drugs reimbursed by the National Health Service for health  ... 
doi:10.1097/01.ede.0000362736.78454.e2 fatcat:e6znysbbefhkno24vc6vhfcotq

A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks

Vinayak T Patil
2013 IOSR Journal of Computer Engineering  
This paper focuses on a probabilistic rebroadcast protocol based on neighbor coverage to reduce the routing overhead in MANETs.  ...  One of the fundamental challenges of MANETs is the design of dynamic routing protocols with good performance and less overhead.  ...  And an expert can propose new solutions based on more recent trends. IV. Case Study An example of use is presented for illustration.  ... 
doi:10.9790/0661-1260109 fatcat:jundvgfvpjcdpmtloz2z2w6ige

Programming and self stabilization for wireless sensor networks PROGRAMMING AND SELF STABILIZATION FOR WIRELESS SENSOR NETWORKS Title and Department ____________________________________ Date PROGRAMMING AND SELF STABILIZATION FOR WIRELESS SENSOR NETWORKS

Ghosh Kajari, Dastidar, Kajari Dastidar, Kajari Dastidar
2009 unpublished
Another case study with tokens involves selective activation of RFID tags in a scenario where among the three RFID tags present only one can work at a time.  ...  One of the case studies we have done uses the token variable to achieve increased lifetime of sensors in a ring topology. The working of token is hidden from the user.  ...  One important condition for a network with tokens is to self-stabilize, e.g. in the case of mutual exclusion algorithm, we need only one token to be present in the entire network.  ... 
« Previous Showing results 1 — 15 out of 3,712 results