License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2021.11
URN: urn:nbn:de:0030-drops-157863
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15786/
Coy, Sam ;
Czumaj, Artur ;
Feldmann, Michael ;
Hinnenthal, Kristian ;
Kuhn, Fabian ;
Scheideler, Christian ;
Schneider, Philipp ;
Struijs, Martijn
Near-Shortest Path Routing in Hybrid Communication Networks
Abstract
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.
BibTeX - Entry
@InProceedings{coy_et_al:LIPIcs.OPODIS.2021.11,
author = {Coy, Sam and Czumaj, Artur and Feldmann, Michael and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp and Struijs, Martijn},
title = {{Near-Shortest Path Routing in Hybrid Communication Networks}},
booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)},
pages = {11:1--11:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-219-8},
ISSN = {1868-8969},
year = {2022},
volume = {217},
editor = {Bramas, Quentin and Gramoli, Vincent and Milani, Alessia},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15786},
URN = {urn:nbn:de:0030-drops-157863},
doi = {10.4230/LIPIcs.OPODIS.2021.11},
annote = {Keywords: Hybrid networks, overlay networks}
}
|
Keywords: |
|
Hybrid networks, overlay networks |
|
Collection: |
|
25th International Conference on Principles of Distributed Systems (OPODIS 2021) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
28.02.2022 |
