Brief announcement: Mobile agent rendezvous on edge evolving rings

Tomoko Izumi, Yukiko Yamauchi, Sayaka Kamei

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings
Pages92-94
Number of pages3
DOIs
Publication statusPublished - Nov 7 2012
Event14th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2012 - Toronto, ON, Canada
Duration: Oct 1 2012Oct 4 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7596 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other14th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2012
CountryCanada
CityToronto, ON
Period10/1/1210/4/12

Fingerprint

Rendezvous
Mobile agents
Mobile Agent
Topology
Ring
Network Topology
Periodicity
Solvability
Design

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Izumi, T., Yamauchi, Y., & Kamei, S. (2012). Brief announcement: Mobile agent rendezvous on edge evolving rings. In Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings (pp. 92-94). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7596 LNCS). https://doi.org/10.1007/978-3-642-33536-5_10

Brief announcement : Mobile agent rendezvous on edge evolving rings. / Izumi, Tomoko; Yamauchi, Yukiko; Kamei, Sayaka.

Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings. 2012. p. 92-94 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7596 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Izumi, T, Yamauchi, Y & Kamei, S 2012, Brief announcement: Mobile agent rendezvous on edge evolving rings. in Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7596 LNCS, pp. 92-94, 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2012, Toronto, ON, Canada, 10/1/12. https://doi.org/10.1007/978-3-642-33536-5_10
Izumi T, Yamauchi Y, Kamei S. Brief announcement: Mobile agent rendezvous on edge evolving rings. In Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings. 2012. p. 92-94. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-33536-5_10
Izumi, Tomoko ; Yamauchi, Yukiko ; Kamei, Sayaka. / Brief announcement : Mobile agent rendezvous on edge evolving rings. Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings. 2012. pp. 92-94 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bf0615b77b184fcd998c7a7e6ec61b3f,
title = "Brief announcement: Mobile agent rendezvous on edge evolving rings",
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.",
author = "Tomoko Izumi and Yukiko Yamauchi and Sayaka Kamei",
year = "2012",
month = "11",
day = "7",
doi = "10.1007/978-3-642-33536-5_10",
language = "English",
isbn = "9783642335358",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "92--94",
booktitle = "Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings",

}

TY - GEN

T1 - Brief announcement

T2 - Mobile agent rendezvous on edge evolving rings

AU - Izumi, Tomoko

AU - Yamauchi, Yukiko

AU - Kamei, Sayaka

PY - 2012/11/7

Y1 - 2012/11/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84868278597&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84868278597&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-33536-5_10

DO - 10.1007/978-3-642-33536-5_10

M3 - Conference contribution

AN - SCOPUS:84868278597

SN - 9783642335358

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 92

EP - 94

BT - Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium, SSS 2012, Proceedings

ER -