Brief announcement: mobile agent rendezvous on edge evolving rings

Authors:
Tomoko Izumi;Yukiko Yamauchi;Sayaka Kamei
Affiliations:
Ritsumeikan University, Japan;Kyushu University, Japan;Hiroshima University, Japan
Venue:
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Year:
2012

Citing 3
Cited 0

Mobile Agent Rendezvous in a Ring

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Deterministic Rendezvous in Trees with Little Memory

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Exploration of Periodically Varying Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The rendezvous problem of mobile agents is to make agents, which are initially distributed in a network, meet at a non-predefined location. The challenging issue is to design rendezvous algorithms which work in anonymous systems. Previous works such as [2,4,5] characterized its solvability with the symmetricity and periodicity of network topology and initial locations of agents. However, most existing works (except [3]) assume "static" networks, where its topology does not change during the execution.