The mobile agent rendezvous problem in the ring

1. Models for mobile agent computing

Introduction

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

Introduction

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

Introduction

Impossibility of rendezvous

Rendezvous with detection

Conditional solutions

Comments and bibliographic remarks. 4. Randomized rendezvous in a ring

Introduction

Random walk algorithm

Randomization and tokens

Time/memory trade-offs

Coin half tour algorithm

Approximate counting algorithm

Comments and bibliographic remarks. 5. Other models

Introduction

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

Look-compute-move

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

Introduction

Synchronous torus

Memory lower bounds for rendezvous

Rendezvous algorithms

Trees

Arbitrary graphs

Comments and bibliographic remarks. Bibliography

Glossary

Authors' biographies

Index