Document Open Access Logo

Near-Shortest Path Routing in Hybrid Communication Networks

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

PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2021.11.pdf
  • Filesize: 1.1 MB
  • 23 pages

Document Identifiers

Author Details

Sam Coy
  • University of Warwick, Coventry, UK
Artur Czumaj
  • University of Warwick, Coventry, UK
Michael Feldmann
  • Paderborn University, Germany
Kristian Hinnenthal
  • Paderborn University, Germany
Fabian Kuhn
  • University of Freiburg, Germany
Christian Scheideler
  • Paderborn University, Germany
Philipp Schneider
  • University of Freiburg, Germany
Martijn Struijs
  • TU Eindhoven, The Netherlands

Funding

  • Coy, Sam: Supported by the Centre for Discrete Mathematics and its Applications (DIMAP) and by an EPSRC studentship.
  • Czumaj, Artur: Supported by the Centre for Discrete Mathematics and its Applications (DIMAP), by EPSRC award EP/V01305X/1, and by an IBM Award.
  • Scheideler, Christian: Supported by the German Research Foundation (DFG) within the Collaborative Research Center 901 ”On-The-Fly Computing” under the project number 160364472-SFB901.

Cite AsGet BibTex

Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, and Martijn Struijs. Near-Shortest Path Routing in Hybrid Communication Networks. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 11:1-11:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.OPODIS.2021.11

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.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • Hybrid networks
  • overlay networks

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Yehuda Afek, Gad M. Landau, Baruch Schieber, and Moti Yung. The power of multimedia: Combining point-to-point and multiaccess networks. Information and Computation, 84(1):97-118, January 1990. URL: https://doi.org/10.1016/0890-5401(90)90035-G.
  2. John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, and Suman Sourav. Distributed graph realizations. In Proc. of the 34th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2020), pages 158-167, 2020. URL: https://doi.org/10.1109/IPDPS47924.2020.00026.
  3. John Augustine, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. Shortest paths in a hybrid network model. In Proc. of the 31st ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), pages 1280-1299, 2020. URL: https://doi.org/10.1137/1.9781611975994.78.
  4. Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, and Michiel H. M. Smid. Improved routing on the Delaunay triangulation. In Proc. of the 26th Annual European Symposium on Algorithms (ESA 2018), pages 22:1-22:13, 2018. URL: https://doi.org/10.4230/LIPIcs.ESA.2018.22.
  5. Prosenjit Bose, Pat Morin, Ivan Stojmenovic, and Jorge Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7(6):609-616, 2001. URL: https://doi.org/10.1023/A:1012319418150.
  6. Jehoshua Bruck, Jie Gao, and Anxiao Jiang. MAP: medial axis based geometric routing in sensor networks. Wireless Networks, 13(6):835-853, 2007. URL: https://doi.org/10.1007/s11276-006-9857-z.
  7. Antonio Carzaniga, Koorosh Khazaei, and Fabian Kuhn. Oblivious low-congestion multicast routing in wireless networks. In Proc. of the 13th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2012), pages 155-164, 2012. URL: https://doi.org/10.1145/2248371.2248395.
  8. Jannik Castenow, Christina Kolb, and Christian Scheideler. A bounding box overlay for competitive routing in hybrid communication networks. In Proc. of the 21st International Conference on Distributed Computing and Networking (ICDCN 2020), pages 14:1-14:10, 2020. URL: https://doi.org/10.1145/3369740.3369777.
  9. Keren Censor-Hillel, Dean Leitersdorf, and Volodymyr Polosukhin. Distance computations in the hybrid network model via oracle simulations. CoRR, abs/2010.13831, 2020. URL: http://arxiv.org/abs/2010.13831.
  10. Hristo N. Djidjev, Grammati E. Pantziou, and Christos D. Zaroliagis. Computing shortest paths and distances in planar graphs. In Proc. of the 18th International Colloquium on Automata, Languages and Programming (ICALP 1991), pages 327-338, 1991. URL: https://doi.org/10.1007/3-540-54233-7_145.
  11. Michael Feldmann, Kristian Hinnenthal, and Christian Scheideler. Fast hybrid network algorithms for shortest paths in sparse graphs. In Proc. of the 24th International Conference on Principles of Distributed Systems (OPODIS 2020), pages 31:1-31:16, 2020. URL: https://doi.org/10.4230/LIPIcs.OPODIS.2020.31.
  12. Klaus-Tycho Foerster and Stefan Schmid. Survey of reconfigurable data center networks: Enablers, algorithms, complexity. SIGACT News, 50(2):62-79, 2019. URL: https://doi.org/10.1145/3351452.3351464.
  13. Jie Gao and Mayank Goswami. Medial axis based routing has constant load balancing factor. In Proc. of the 23rd Annual European Symposium on Algorithms (ESA 2015), pages 557-569, 2015. URL: https://doi.org/10.1007/978-3-662-48350-3_47.
  14. Jie Gao and Li Zhang. Well-separated pair decomposition for the unit-disk graph metric and its applications. SIAM Journal on Computing, 35(1):151-169, 2005. URL: https://doi.org/10.1137/S0097539703436357.
  15. Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler. Distributed monitoring of network properties: The power of hybrid networks. In Proc. of the 44th International Colloquium on Automata, Languages and Programming (ICALP 2017), pages 137:1-137:15, 2017. URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.137.
  16. Thorsten Götte, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. Time-optimal construction of overlay networks. CoRR, abs/2009.03987, 2020. URL: http://arxiv.org/abs/2009.03987.
  17. Anupam Gupta, Amit Kumar, and Rajeev Rastogi. Traveling with a pez dispenser (or, routing issues in MPLS). SIAM Journal on Computing, 34(2):453-474, 2004. URL: https://doi.org/10.1137/S0097539702409927.
  18. Fabian Höflinger, Joan Bordoy, Rui Zhang, Amir Bannoura, Nikolas Simon, Leonhard M. Reindl, and Christian Schindelhauer. Localization system based on ultra low-power radio landmarks. In Proc. of the 7th International Conference on Sensor Networks (SENSORNETS 2018), pages 51-59, 2018. URL: https://doi.org/10.5220/0006608800510059.
  19. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, and Paul Seiferth. Routing in unit disk graphs. Algorithmica, 80(3):830-848, 2018. URL: https://doi.org/10.1007/s00453-017-0308-2.
  20. Dimitris J Kavvadias, Grammati E Pantziou, Paul G Spirakis, and Christos D Zaroliagis. Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems. Theoretical Computer Science, 168(1):121-154, 1996. URL: https://doi.org/10.1016/S0304-3975(96)00065-5.
  21. Fabian Kuhn and Philipp Schneider. Computing shortest paths and diameter in the hybrid network model. In Proc. of the 39th Annual ACM Symposium on Principles of Distributed Computing (PODC 2020), pages 109-118, 2020. URL: https://doi.org/10.1145/3382734.3405719.
  22. Fabian Kuhn, Roger Wattenhofer, Yan Zhang, and Aaron Zollinger. Geometric ad-hoc routing: of theory and practice. In Proc. of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), pages 63-72, 2003. URL: https://doi.org/10.1145/872035.872044.
  23. Fabian Kuhn, Roger Wattenhofer, and Aaron Zollinger. Asymptotically optimal geometric mobile ad-hoc routing. In Proc. of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), pages 24-33, 2002. URL: https://doi.org/10.1145/570810.570814.
  24. Fabian Kuhn, Roger Wattenhofer, and Aaron Zollinger. Worst-case optimal and average-case efficient geometric ad-hoc routing. In Proc. of the 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), pages 267-278, 2003. URL: https://doi.org/10.1145/778415.778447.
  25. Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, and Satish Rao. Randomized routing and sorting on fixed-connection networks. Journal of Algorithms, 17(1):157-205, 1994. URL: https://doi.org/10.1006/jagm.1994.1030.
  26. Wolfgang Mulzer and Max Willert. Compact routing in unit disk graphs. In Proc. of the 31st International Symposium on Algorithms and Computation (ISAAC 2020), pages 16:1-16:14, 2020. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2020.16.
  27. Nicola Santoro and Ramez Khatib. Labelling and implicit routing in networks. The Computer Journal, 28(1):5-8, 1985. URL: https://doi.org/10.1093/comjnl/28.1.5.
  28. Mikkel Thorup and Uri Zwick. Compact routing schemes. In Proc. of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), pages 1-10, 2001. URL: https://doi.org/10.1145/378580.378581.
  29. Ge Xia. The stretch factor of the Delaunay triangulation is less than 1.998. SIAM Journal on Computing, 42(4):1620-1659, 2013. URL: https://doi.org/10.1137/110832458.
  30. Chenyu Yan, Yang Xiang, and Feodor F. Dragan. Compact and low delay routing labeling scheme for unit disk graphs. Computational Geometry: Theory and Applications, 45(7):305-325, 2012. URL: https://doi.org/10.1016/j.comgeo.2012.01.015.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact