2013 IEEE 33rd International Conference on Distributed Computing Systems (2003)

Providence, Rhode Island

May 19, 2003 to May 22, 2003

ISSN: 1063-6927

ISBN: 0-7695-1920-2

pp: 592

Evangelos Kranakis , Carleton University

Nicola Santoro , Carleton University

Cindy Sawchuk , Carleton University

Danny Krizanc , Wesleyan University

ABSTRACT

In the rendezvous search problem, two mobile agents must move along the n nodes of a network so as to minimize the time required to meet or rendezvous. When the mobile agents are identical and the network is anonymous, however, the resulting symmetry can make the problem impossible to solve. Symmetry is typically broken by having the mobile agents run either a randomized algorithm or different deterministic algorithms. We investigate the use of identical tokens to break symmetry so that the two mobile agents can run the same deterministic algorithm. After deriving the explicit conditions under which identical tokens canbeused to breaksymmetry onthen node ring, we derive the lower and upper bounds for the time and memory complexity of the rendezvous search problem with various parameter sets. While these results suggest a possible tradeoff between the mobile agents? memory and the time complexity of the rendezvous search problem, we prove that this trade-off is limited.

INDEX TERMS

null

CITATION

Evangelos Kranakis,
Nicola Santoro,
Cindy Sawchuk,
Danny Krizanc,
"Mobile Agent Rendezvous in a Ring",

*2013 IEEE 33rd International Conference on Distributed Computing Systems*, vol. 00, no. , pp. 592, 2003, doi:10.1109/ICDCS.2003.1203510SEARCH