Near-Shortest Path Routing in Hybrid Communication Networks

Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, Martijn A.C. Struijs

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

4 Citaten (Scopus)
118 Downloads (Pure)

Samenvatting

Hybrid networks, i.e., networks that leverage different means of communication, become ever more widespread. To allow theoretical study of such networks, [Augustine et al., SODA'20] introduced the HYBRID model, which is based on the concept of synchronous message passing and uses two fundamentally different principles of communication: a local mode, which allows every node to exchange one message per round with each neighbor in a local communication graph; and a global mode where any pair of nodes can exchange messages, but only few such exchanges can take place per round. A sizable portion of the previous research for the HYBRID model revolves around basic communication primitives and computing distances or shortest paths in networks. In this paper, we extend this study to a related fundamental problem of computing compact routing schemes for near-shortest paths in the local communication graph. We demonstrate that, for the case where the local communication graph is a unit-disc graph with n nodes that is realized in the plane and has no radio holes, we can deterministically compute a routing scheme that has constant stretch and uses labels and local routing tables of size O(log n) bits in only O(log n) rounds.
Originele taal-2Engels
Titel25th International Conference on Principles of Distributed Systems (OPODIS 2021)
RedacteurenQuentin Bramas, Vincent Gramoli, Vincent Gramoli, Alessia Milani
UitgeverijSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Pagina's11:1-11:23
Aantal pagina's23
Volume217
ISBN van elektronische versie978-3-95977-219-8
DOI's
StatusGepubliceerd - 28 feb. 2022

Publicatie series

NaamLeibniz International Proceedings in Informatics, LIPIcs
Volume217
ISSN van geprinte versie1868-8969

Vingerafdruk

Duik in de onderzoeksthema's van 'Near-Shortest Path Routing in Hybrid Communication Networks'. Samen vormen ze een unieke vingerafdruk.

Citeer dit