Feinerman et al. provide illustrations concerned with the usefulness of different processing speeds and asynchrony of tasks of the operating agents in distributed computing systems. To investigate the rendezvous (meeting point) problem, a cycle topology is considered, which discusses and models different scenarios of the problem.

The scenarios are discussed with regard to different operational parameters of the involved agents. The main aim of the research is the estimation of lower and upper bounds of the time it takes until a rendezvous occurs. Length of the cycle, speed of moving agents in the cycle, movement direction, awareness of the direction, leaving arbitrary marks, and white board model were the different alternative scenarios discussed in the paper.

Considering the nature of agents with stochastic speed difference, research on multiple agent scenarios and other topological structures have been counted as cases for future investigations.

In addition to smooth reasoning concerned with the achieved formulas and theorems, the paper provides a simplification of the asynchrony problem in the distributed system to a kind of agents racing problem, to get more insight into the agents’ interactions and behavior.