How to meet in anonymous network

A set of k mobile agents with distinct identifiers and located in nodes of an unknown anonymous connected network, have to meet at some node. We show that this gathering problem is no harder than its special case for k = 2, called the rendezvous problem, and design deterministic protocols solving the rendezvous problem with arbitrary startups in rings and in general networks. The measure of performance is the number of steps since the startup of the last agent until the rendezvous is achieved For rings we design an oblivious protocol with cost ${\cal O}(n\log \ell)$, where n is the size of the network and l is the minimum label of participating agents. This result is asymptotically optimal due to the lower bound showed in [18] For general networks we show a protocol with cost polynomial in n and logl, independent of the maximum difference τ of startup times, which answers in affirmative the open question from [22]

[1]  Amos Israeli,et al.  Token management schemes and random walks yield self-stabilizing mutual exclusion , 1990, PODC '90.

[2]  Moti Yung,et al.  Agent Rendezvous: A Dynamic Symmetry-Breaking Problem , 1996, ICALP.

[3]  Micah Adler,et al.  Randomized Pursuit-Evasion in Graphs , 2002, Combinatorics, Probability and Computing.

[4]  Nicola Santoro,et al.  Solving the Robots Gathering Problem , 2003, ICALP.

[5]  Rafail Ostrovsky,et al.  Self-stabilizing algorithms for synchronous unidirectional rings , 1996, SODA '96.

[6]  T. Schelling,et al.  The Strategy of Conflict. , 1961 .

[7]  Richard Weber,et al.  The rendezvous problem on discrete locations , 1990, Journal of Applied Probability.

[8]  Uri Zwick,et al.  Deterministic rendezvous, treasure hunts and strongly universal exploration sequences , 2007, SODA '07.

[9]  M. Karonski.  Collisions among Random Walks on a Graph , 1993 .

[10]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[11]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[12]  S. Alpern.  The Rendezvous Search Problem , 1995 .

[13]  Steve Alpern.  Rendezvous Search on Labelled Networks , 2000 .

[14]  Andrzej Pelc,et al.  Asynchronous Deterministic Rendezvous in Graphs , 2005, MFCS.

[15]  Lyn C. Thomas.  Finding Your Kids When They Are Lost , 1992 .

[16]  Shmuel Gal.  Rendezvous Search on the Line , 1999, Oper. Res..

[17]  S. Alpern,et al.  Minimax Rendezvous on the Line , 1996 .

[18]  Stephen A. Cook,et al.  Problems Complete for Deterministic Logarithmic Space , 1987, J. Algorithms.

[19]  Shmuel Gal,et al.  The theory of search games and rendezvous , 2002, International series in operations research and management science.

[20]  Nicola Santoro,et al.  Gathering of Asynchronous Oblivious Robots with Limited Visibility , 2001, STACS.

[21]  Nicola Santoro,et al.  Mobile agent rendezvous in a ring , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[22]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[23]  S. Gal,et al.  Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution , 1998 .

[24]  V. Baston,et al.  Rendezvous search on a graph , 1999 .

[25]  Steve Alpern.  Rendezvous search on labeled networks , 2002 .

[26]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003, ESA.

[27]  Lisa Higham,et al.  Meeting Times of Random Walks on Graphs , 1999, Inf. Process. Lett..

[28]  Ren-Hong Wang,et al.  On computational geometry , 2003 .

[29]  S. Gal,et al.  Rendezvous search when marks are left at the starting points , 2001 .

[30]  Sándor P. Fekete,et al.  Two Dimensional Rendezvous Search , 2001, Oper. Res..

[31]  Sándor P. Fekete,et al.  Asymmetric rendezvous on the plane , 1998, SCG '98.

[32]  Andrzej Pelc,et al.  Polynomial Deterministic Rendezvous in Arbitrary Graphs , 2004, ISAAC.

[33]  Michel Rigo,et al.  Abstract numeration systems and tilings , 2005 .

[34]  Prabhakar Raghavan,et al.  Random walks on weighted graphs and applications to on-line algorithms , 1993, JACM.