Front cover image for The mobile agent rendezvous problem in the ring

The mobile agent rendezvous problem in the ring

Provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting. For the most part this volume concentrates on the simplest case of two agents attempting to rendezvous on a ring network. Other situations including multiple agents, faulty nodes and other topologies are also examined.
eBook, English, ©2010
Springer, Cham, Switzerland, ©2010
1 online resource (xvi, 106 pages) : illustrations (some color)
9781608451371, 9783031019999, 1608451372, 3031019997
1. Models for mobile agent computing
What is a mobile agent
Why mobile agents
An algorithmic model for mobile agents
Mobile agents
Distributed networks
Resource measures
Mobile agent rendezvous
Outline of the book
Comments and bibliographic remarks. 2. Deterministic rendezvous in a ring
A single stationary token
The feasibility of rendezvous
The time complexity of rendezvous
Memory tradeoff for rendezvous with detection
Limits to the memory trade-off
Movable tokens
Comments and bibliographic remarks. 3. Multiple agent rendezvous in a ring
Impossibility of rendezvous
Rendezvous with detection
Conditional solutions
Comments and bibliographic remarks. 4. Randomized rendezvous in a ring
Random walk algorithm
Randomization and tokens
Time/memory trade-offs
Coin half tour algorithm
Approximate counting algorithm
Comments and bibliographic remarks. 5. Other models
Leader election and rendezvous
Rendezvous with failing tokens
Rendezvous when tokens fail upon release
Rendezvous when tokens can fail at any time
The cost of token failure
Flickering tokens
Asynchronous rendezvous
Model and terminology
Impossibility results
Gathering configurations with a single multiplicity
Gathering rigid configurations
Gathering an odd number of robots
Dangerous networks
Black-hole search in an asynchronous ring
Rendezvous in asynchronous rings in spite of a black-hole
Comments and bibliographic remarks. 6. Other topologies
Synchronous torus
Memory lower bounds for rendezvous
Rendezvous algorithms
Arbitrary graphs
Comments and bibliographic remarks. Bibliography
Authors' biographies