Rendezvous And Exploration With Mobile Agents

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.