Routing Schemes and Distance Oracles in the Hybrid Model

Authors Fabian Kuhn , Philipp Schneider

Thumbnail PDF


  • Filesize: 0.87 MB
  • 22 pages

Document Identifiers

Author Details

Fabian Kuhn
  • Universität Freiburg, Germany
Philipp Schneider
  • Universitä Freiburg, Germany

Cite AsGet BibTex

Fabian Kuhn and Philipp Schneider. Routing Schemes and Distance Oracles in the Hybrid Model. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 28:1-28:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


The HYBRID model was introduced as a means for theoretical study of distributed networks that use various communication modes. Conceptually, it is a synchronous message passing model with a local communication mode, where in each round each node can send large messages to all its neighbors in a local network (a graph), and a global communication mode, where each node is allotted limited (polylogarithmic) bandwidth per round to communicate with any node in the network. Prior work has often focused on shortest paths problems in the local network, as their global nature makes these an interesting case study how combining communication modes in the HYBRID model can overcome the individual lower bounds of either mode. In this work we consider a similar problem, namely computation of distance oracles and routing schemes. In the former, all nodes have to compute local tables, which allows them to look up the distance (estimates) to any target node in the local network when provided with the label of the target. In the latter, it suffices that nodes give the next node on an (approximately) shortest path to the target. Our goal is to compute these local tables as fast as possible with labels as small as possible. We show that this can be done exactly in Õ(n^{1/3}) communication rounds and labels of size Θ(n^{2/3}) bits. For constant stretch approximations we achieve labels of size O(log n) in the same time. Further, as our main technical contribution, we provide computational lower bounds for a variety of problem parameters. For instance, we show that computing solutions with stretch below a certain constant takes Ω̃(n^{1/3}) rounds even for labels of size O(n^{2/3}).

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Mathematics of computing → Graph algorithms
  • Distributed Computing
  • Graph Algorithms
  • Complexity Analysis


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


  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:
  2. Noga Alon, Shlomo Hoory, and Nathan Linial. The moore bound for irregular graphs. Graphs and Combinatorics, 18, September 2001. URL:
  3. Ioannis Anagnostides and Themis Gouleakis. Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. In Seth Gilbert, editor, 35th International Symposium on Distributed Computing (DISC 2021), volume 209 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1-5:19, Dagstuhl, Germany, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL:
  4. Arash Asadi, Vincenzo Mancuso, and Rohit Gupta. An sdr-based experimental study of outband d2d communications. In IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, pages 1-9, 2016. URL:
  5. John Augustine, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. Shortest paths in a hybrid network model. In Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '20, pages 1280-1299, USA, 2020. Society for Industrial and Applied Mathematics. Google Scholar
  6. Clark T. Benson. Minimal regular graphs of girths eight and twelve. Canadian Journal of Mathematics, 18:1091-1094, 1966. URL:
  7. Keren Censor-Hillel, Dean Leitersdorf, and Volodymyr Polosukhin. Distance Computations in the Hybrid Network Model via Oracle Simulations. In Markus Bläser and Benjamin Monmege, editors, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), volume 187 of Leibniz International Proceedings in Informatics (LIPIcs), pages 21:1-21:19, Dagstuhl, Germany, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL:
  8. Keren Censor-Hillel, Dean Leitersdorf, and Volodymyr Polosukhin. On sparsity awareness in distributed computations. In Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '21, pages 151-161, New York, NY, USA, 2021. Association for Computing Machinery. URL:
  9. Paul Erdős and Miklós Simonovits. Compactness results in extremal graph theory. Comb, 2(3):275-288, 1982. Google Scholar
  10. 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:
  11. Kai Han, Zhiming Hu, Jun Luo, and Liu Xiang. Rush: Routing and scheduling for hybrid data center networks. In 2015 IEEE Conference on Computer Communications (INFOCOM), pages 415-423, 2015. URL:
  12. Taisuke Izumi and Roger Wattenhofer. Time lower bounds for distributed distance oracles. In Marcos K. Aguilera, Leonardo Querzoni, and Marc Shapiro, editors, Principles of Distributed Systems, pages 60-75, Cham, 2014. Springer International Publishing. Google Scholar
  13. Fabian Kuhn and Philipp Schneider. Computing shortest paths and diameter in the hybrid network model. In Proceedings of the 39th Symposium on Principles of Distributed Computing, PODC '20, pages 109-118, New York, NY, USA, July 2020. Association for Computing Machinery. URL:
  14. Fabian Kuhn and Philipp Schneider. Routing schemes and distance oracles in the hybrid model. arXiv preprint, 2022. URL:
  15. Felix Lazebnik, Vasiliy A. Ustimenko, and Andrew J. Woldar. Upper bounds on the order of cages. the electronic journal of combinatorics, pages R13-R13, 1997. Google Scholar
  16. Christoph Lenzen. Optimal deterministic routing and sorting on the congested clique. In Proc. 32nd Symp. on Principles of Distr. Comp. (PODC), pages 42-50, 2013. Google Scholar
  17. Nancy A Lynch. Distributed algorithms. Elsevier, 1996. Google Scholar
  18. Claude Elwood Shannon. A mathematical theory of communication. The Bell system technical journal, 27(3):379-423, 1948. Google Scholar
  19. Robert Singleton. On minimal graphs of maximum even girth. J. Comb. Theory, 1:306-332, 1966. Google Scholar
  20. Jeffrey D. Ullman and Mihalis Yannakakis. High-probability parallel transitive-closure algorithms. Journal on Computing, 20(1):100-125, 1991. Google Scholar
  21. Jacques Verstraëte. Extremal problems for cycles in graphs. In Recent trends in combinatorics, pages 83-116. Springer, 2016. Google Scholar
  22. Stefano Vissicchio, Laurent Vanbever, and Olivier Bonaventure. Opportunities and research challenges of hybrid software defined networks. SIGCOMM Comput. Commun. Rev., 44(2):70-75, April 2014. URL:
  23. Guohui Wang, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, T.S. Eugene Ng, Michael Kozuch, and Michael Ryan. C-through: Part-time optics in data centers. In Proceedings of the ACM SIGCOMM 2010 Conference, SIGCOMM '10, pages 327-338, New York, NY, USA, 2010. Association for Computing Machinery. URL:
  24. Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, and Xiaorui Sun. Universally-optimal distributed shortest paths and transshipment via graph-based 𝓁1-oblivious routing. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2549-2579. SIAM, 2022. Google Scholar