A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Self-stabilizing extensions for message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Self-stabilization by counter flushing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
SuperStabilizing protocols for dynamic distributed systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM (JACM)
Self-stabilization
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
SIAM Journal on Computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
GS3: scalable self-configuration and self-healing in wireless networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Computer Networks
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Design and Analysis of a Fast Local Clustering Service for Wireless Sensor Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
The geometry of graphs and some of its algorithmic applications
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Time-efficient self-stabilizing algorithms through hierarchical structures
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Towards a theory of self-organization
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Asynchronous and fully self-stabilizing time-adaptive majority consensus
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Self-stabilizing and self-orgenizing mobile networks
Proceedings of the fifth international workshop on Foundations of mobile computing
Light enabling snap-stabilization of fundamental protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
Calibrating embedded protocols on asynchronous systems
Information Sciences: an International Journal
Stabilization in dynamic systems with varying equilibrium
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Snap-stabilization in message-passing systems
Journal of Parallel and Distributed Computing
Stabilizing data-link over non-FIFO channels with optimal fault-resilience
Information Processing Letters
Brief announcement: network-destabilizing attacks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Self-stabilization ensures automatic recovery from an arbitrary state; we define self-organization as a property of algorithms which display local attributes. More precisely, we say that an algorithm is self-organizing if (1) it converges in sublinear time and (2) reacts “fast” to topology changes. If s(n) is an upper bound on the convergence time and d(n) is an upper bound on the convergence time following a topology change, then s(n) ∈o(n) and d(n) ∈o(s(n)). The self-organization property can then be used for gaining, in sub-linear time, global properties and reaction to changes. We present self-stabilizing and self-organizing algorithms for many distributed algorithms, including distributed snapshot and leader election. We present a new randomized self-stabilizing distributed algorithm for cluster definition in communication graphs of bounded degree processors. These graphs reflect sensor networks deployment. The algorithm converges in O(logn) expected number of rounds, handles dynamic changes locally and is, therefore, self-organizing. Applying the clustering algorithm to specific classes of communication graphs, in O(logn) levels, using an overlay network abstraction, results in a self-stabilizing and self-organizing distributed algorithm for hierarchy definition. Given the obtained hierarchy definition, we present an algorithm for hierarchical distributed snapshot. The algorithms are based on a new basic snap-stabilizing snapshot algorithm, designed for message passing systems in which a distributed spanning tree is defined and in which processors communicate using bounded links capacity. The combination of the self-stabilizing and self-organizing distributed hierarchy construction and the snapshot algorithm form an efficient self-stabilizer transformer. Given a distributed algorithm for a specific task, we are able to convert the algorithm into a self-stabilizing algorithm for the same task with an expected convergence time of O(log2n) rounds.