Optimal packet-oblivious stable routing in multi-hop wireless networks

Vicent Cholvi, Paweł Garncarek, Tomasz Jurdziński, Dariusz R. Kowalski

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

Abstract

Stability is an important issue in order to characterize the performance of a network, and it has become a major topic of study in the last decade. Roughly speaking, a communication network system is said to be stable if the number of packets waiting to be delivered (backlog) is finitely bounded at any one time. In this paper, we introduce a new family of combinatorial structures, which we call universally strong selectors, that are used to provide a set of transmission schedules. Making use of these structures, combined with some known queuing policies, we propose a packet-oblivious routing algorithm which is working without using any global topological information, and guarantees stability for certain injection rates. We show that this protocol is asymptotically optimal regarding the injection rate for which stability is guaranteed. Furthermore, we also introduce a packet-oblivious routing algorithm that guarantees stability for higher traffic. This algorithm is optimal regarding the injection rate for which stability is guaranteed. However, it needs to use some global information of the system topology.

Original languageEnglish (US)
Title of host publicationStructural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Proceedings
EditorsAndrea Werneck Richa, Christian Scheideler
PublisherSpringer
Pages165-182
Number of pages18
ISBN (Print)9783030549206
DOIs
StatePublished - 2020
Event27th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2020 - Paderborn, Germany
Duration: Jun 29 2020Jul 1 2020

Publication series

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

Conference

Conference27th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2020
CountryGermany
CityPaderborn
Period6/29/207/1/20

Keywords

  • Adversarial queuing
  • Interference
  • Packet latency
  • Routing
  • Stability
  • Wireless network

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Optimal packet-oblivious stable routing in multi-hop wireless networks'. Together they form a unique fingerprint.

  • Cite this

    Cholvi, V., Garncarek, P., Jurdziński, T., & Kowalski, D. R. (2020). Optimal packet-oblivious stable routing in multi-hop wireless networks. In A. W. Richa, & C. Scheideler (Eds.), Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Proceedings (pp. 165-182). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12156 LNCS). Springer. https://doi.org/10.1007/978-3-030-54921-3_10