A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Introduction to distributed algorithms
Introduction to distributed algorithms
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Self-Stabilization by Counter Flushing
SIAM Journal on Computing
IEEE Transactions on Computers
On Formal Modeling of Agent Computations
FAABS '00 Proceedings of the First International Workshop on Formal Approaches to Agent-Based Systems-Revised Papers
Agents, Distributed Algorithms, and Stabilization
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
ICDCS '99 Workshop on Self-stabilizing Systems
Towards Multi-Swarm Problem Solving in Networks
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Self-stabilization: randomness to reduce space
Distributed Computing
A toolkit for building dependable and extensible home networking applications
WSS'00 Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Concurrent Reading and Writing with Mobile Agents
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
| Hi-index | 0.00 |
In the execution of distributed algorithms on a network of processes, the actions of the individual processes are scheduled by their local schedulers or demons. The schedulers communicate with their immediate neighbors using shared registers or message passing. This paper examines an alternative approach to the design of distributed algorithms, where mobile agents are allowed to traverse a network, extract state information, and make appropriate modification of the local states to steer the system towards a global goal. The primary emphasis of this paper is system stabilization. Both single-agent and multi-agent protocols are examined, and the advantages and disadvantages of agent-based stabilization are discussed.