Fault-Tolerant Rendezvous in Networks

Two mobile agents, starting from different nodes of an unknown network, have to meet at the same node. Agents move in synchronous rounds using a deterministic algorithm. Each agent has a different label, which it can use in the execution of the algorithm, but it does not know the label of the other agent. Agents do not know any bound on the size of the network. In each round an agent decides if it remains idle or if it wants to move to one of the adjacent nodes. Agents are subject to delay faults: if an agent incurs a fault in a given round, it remains in the current node, regardless of its decision. If it planned to move and the fault happened, the agent is aware of it. We consider three scenarios of fault distribution: random (independently in each round and for each agent with constant probability 0 < p < 1), unbounded adversarial (the adversary can delay an agent for an arbitrary finite number of consecutive rounds) and bounded adversarial (the adversary can delay an agent for at most c consecutive rounds, where c is unknown to the agents). The quality measure of a rendezvous algorithm is its cost, which is the total number of edge traversals.

[1]  Andrzej Pelc,et al.  Delays Induce an Exponential Memory Gap for Rendezvous in Trees , 2011, TALG.

[2]  Pat Morin,et al.  Randomized Rendez-Vous with Limited Memory , 2008, LATIN.

[3]  Michal Koucký,et al.  Universal traversal sequences with backtracking , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[4]  Andrzej Pelc,et al.  How to meet asynchronously (almost) everywhere , 2010, SODA '10.

[5]  Shantanu Das,et al.  Rendezvous of Mobile Agents When Tokens Fail Anytime , 2008, OPODIS.

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

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

[8]  Nicola Santoro,et al.  Mobile Agents Rendezvous When Tokens Fail , 2004, SIROCCO.

[9]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

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

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

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

[13]  Shantanu Das.  Mobile Agent Rendezvous in a Ring Using Faulty Tokens , 2008, ICDCN.

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

[15]  Andrzej Pelc,et al.  How to meet when you forget: log-space rendezvous in arbitrary graphs , 2010, Distributed Computing.

[16]  Jérémie Chalopin,et al.  Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty , 2013 .

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

[18]  Andrzej Pelc,et al.  Deterministic network exploration by a single agent with Byzantine tokens , 2012, Inf. Process. Lett..

[19]  D. Aldous.  Meeting times for independent Markov chains , 1991 .

[20]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[21]  Andrzej Pelc,et al.  Deterministic rendezvous in networks: A comprehensive survey , 2012, Networks.

[22]  Nicola Santoro,et al.  Gathering of asynchronous robots with limited visibility , 2005, Theor. Comput. Sci..

[23]  Nicola Santoro,et al.  Distributed Computing by Mobile Robots: Gathering , 2012, SIAM J. Comput..

[24]  Dariusz R. Kowalski,et al.  How to meet in anonymous network , 2006, Theor. Comput. Sci..

[25]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003, Algorithmica.

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

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

[28]  Andrzej Pelc,et al.  How to meet asynchronously at polynomial cost , 2013, PODC '13.

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

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

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

[32]  Andrzej Pelc,et al.  Asynchronous deterministic rendezvous in graphs , 2006, Theor. Comput. Sci..

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

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

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

[36]  Jurek Czyzowicz,et al.  Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids , 2010, DISC.

[37]  Andrzej Pelc,et al.  Gathering Despite Mischief , 2012, SODA.