Brief announcement: Waiting in dynamic networks

Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita

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

Abstract

We consider infrastructure-less highly dynamic networks, where connectivity does not necessarily hold, and the network may actually be disconnected at every time instant. These networks are naturally modeled as time-varying graphs. Clearly the task of designing protocols for these networks is less difficult if the environment allows waiting (i.e., it provides the nodes with store-carry-forward-like mechanisms such as local buffering) than if waiting is not feasible. We provide a quantitative corroboration of this fact in terms of the expressivity of the corresponding time-varying graph; that is in terms of the language generated by the feasible journeys in the graph. We prove that the set of languages L nowait when no waiting is allowed contains all computable languages. On the other end, we prove that L wait is just the family of regular languages. This gap is a measure of the computational power of waiting. We also study bounded waiting; that is when waiting is allowed at a node only for at most d time units. We prove the negative result that L wait[d] = L nowait.

Original languageEnglish
Title of host publicationPODC'12 - Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing
Pages99-100
Number of pages2
DOIs
Publication statusPublished - Aug 20 2012
Event2012 ACM Symposium on Principles of Distributed Computing, PODC'12 - Madeira, Portugal
Duration: Jul 16 2012Jul 18 2012

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Other

Other2012 ACM Symposium on Principles of Distributed Computing, PODC'12
CountryPortugal
CityMadeira
Period7/16/127/18/12

Fingerprint

Formal languages
Network protocols

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Casteigts, A., Flocchini, P., Godard, E., Santoro, N., & Yamashita, M. (2012). Brief announcement: Waiting in dynamic networks. In PODC'12 - Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing (pp. 99-100). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). https://doi.org/10.1145/2332432.2332452

Brief announcement : Waiting in dynamic networks. / Casteigts, Arnaud; Flocchini, Paola; Godard, Emmanuel; Santoro, Nicola; Yamashita, Masafumi.

PODC'12 - Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing. 2012. p. 99-100 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

Casteigts, A, Flocchini, P, Godard, E, Santoro, N & Yamashita, M 2012, Brief announcement: Waiting in dynamic networks. in PODC'12 - Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 99-100, 2012 ACM Symposium on Principles of Distributed Computing, PODC'12, Madeira, Portugal, 7/16/12. https://doi.org/10.1145/2332432.2332452
Casteigts A, Flocchini P, Godard E, Santoro N, Yamashita M. Brief announcement: Waiting in dynamic networks. In PODC'12 - Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing. 2012. p. 99-100. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). https://doi.org/10.1145/2332432.2332452
Casteigts, Arnaud ; Flocchini, Paola ; Godard, Emmanuel ; Santoro, Nicola ; Yamashita, Masafumi. / Brief announcement : Waiting in dynamic networks. PODC'12 - Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing. 2012. pp. 99-100 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).
@inproceedings{b0f73bbce43246c795a610e0f121ec08,
title = "Brief announcement: Waiting in dynamic networks",
abstract = "We consider infrastructure-less highly dynamic networks, where connectivity does not necessarily hold, and the network may actually be disconnected at every time instant. These networks are naturally modeled as time-varying graphs. Clearly the task of designing protocols for these networks is less difficult if the environment allows waiting (i.e., it provides the nodes with store-carry-forward-like mechanisms such as local buffering) than if waiting is not feasible. We provide a quantitative corroboration of this fact in terms of the expressivity of the corresponding time-varying graph; that is in terms of the language generated by the feasible journeys in the graph. We prove that the set of languages L nowait when no waiting is allowed contains all computable languages. On the other end, we prove that L wait is just the family of regular languages. This gap is a measure of the computational power of waiting. We also study bounded waiting; that is when waiting is allowed at a node only for at most d time units. We prove the negative result that L wait[d] = L nowait.",
author = "Arnaud Casteigts and Paola Flocchini and Emmanuel Godard and Nicola Santoro and Masafumi Yamashita",
year = "2012",
month = "8",
day = "20",
doi = "10.1145/2332432.2332452",
language = "English",
isbn = "9781450314503",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
pages = "99--100",
booktitle = "PODC'12 - Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing",

}

TY - GEN

T1 - Brief announcement

T2 - Waiting in dynamic networks

AU - Casteigts, Arnaud

AU - Flocchini, Paola

AU - Godard, Emmanuel

AU - Santoro, Nicola

AU - Yamashita, Masafumi

PY - 2012/8/20

Y1 - 2012/8/20

N2 - We consider infrastructure-less highly dynamic networks, where connectivity does not necessarily hold, and the network may actually be disconnected at every time instant. These networks are naturally modeled as time-varying graphs. Clearly the task of designing protocols for these networks is less difficult if the environment allows waiting (i.e., it provides the nodes with store-carry-forward-like mechanisms such as local buffering) than if waiting is not feasible. We provide a quantitative corroboration of this fact in terms of the expressivity of the corresponding time-varying graph; that is in terms of the language generated by the feasible journeys in the graph. We prove that the set of languages L nowait when no waiting is allowed contains all computable languages. On the other end, we prove that L wait is just the family of regular languages. This gap is a measure of the computational power of waiting. We also study bounded waiting; that is when waiting is allowed at a node only for at most d time units. We prove the negative result that L wait[d] = L nowait.

AB - We consider infrastructure-less highly dynamic networks, where connectivity does not necessarily hold, and the network may actually be disconnected at every time instant. These networks are naturally modeled as time-varying graphs. Clearly the task of designing protocols for these networks is less difficult if the environment allows waiting (i.e., it provides the nodes with store-carry-forward-like mechanisms such as local buffering) than if waiting is not feasible. We provide a quantitative corroboration of this fact in terms of the expressivity of the corresponding time-varying graph; that is in terms of the language generated by the feasible journeys in the graph. We prove that the set of languages L nowait when no waiting is allowed contains all computable languages. On the other end, we prove that L wait is just the family of regular languages. This gap is a measure of the computational power of waiting. We also study bounded waiting; that is when waiting is allowed at a node only for at most d time units. We prove the negative result that L wait[d] = L nowait.

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

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

U2 - 10.1145/2332432.2332452

DO - 10.1145/2332432.2332452

M3 - Conference contribution

AN - SCOPUS:84864973692

SN - 9781450314503

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 99

EP - 100

BT - PODC'12 - Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing

ER -