Self-stabilizing extensions for message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
Closure and Convergence: A Foundation of Fault-Tolerant Computing
IEEE Transactions on Software Engineering - Special issue on software reliability
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
The stabilizing token ring in three bits
Journal of Parallel and Distributed Computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Concurrent Reading and Writing with Mobile Agents
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Self-Stabilizing Agent Traversal
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Easy Stabilization with an Agent
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Cooperating Mobile Agents and Stabilization
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
A Distributed Computational Model for Mobile Agents
Agent Computing and Multi-Agent Systems
Self-stabilizing tiny interaction protocols
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Price stabilization in networks: what is an appropriate model?
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
This note illustrates the use of agents in the stabilization of distributed systems. The goal is to build stabilizing systems on the Internet, where the component processes are not under the control of a single administration. Two examples are presented to illustrate the idea: the first is that of mutual exclusion on a unidirectional ring, and the second deals with the construction of a DFS spanning tree.