Document Open Access Logo

Electrical Flows for Polylogarithmic Competitive Oblivious Routing

Authors Gramoz Goranci , Monika Henzinger , Harald Räcke , Sushant Sachdeva , A. R. Sricharan

PDF
Thumbnail PDF

File

LIPIcs.ITCS.2024.55.pdf
  • Filesize: 1 MB
  • 22 pages

Document Identifiers

Author Details

Gramoz Goranci
  • Faculty of Computer Science, University of Vienna, Austria
Monika Henzinger
  • Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria
Harald Räcke
  • Technical University Munich, Germany
Sushant Sachdeva
  • University of Toronto, Canada
A. R. Sricharan
  • Faculty of Computer Science, UniVie Doctoral School Computer Science DoCS, University of Vienna, Austria

Funding

Monika Henzinger and A. R. Sricharan: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) project Z 422-N, project I 5982-N, and project P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020-2024.
  • Räcke, Harald: Research supported by German Research Foundation (DFG), grant 470029389 (FlexNets), 2021-2024.
  • Sachdeva, Sushant: SS’s work is supported by an Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery Grant RGPIN-2018-06398 and a Sloan Research Fellowship.

Cite AsGet BibTex

Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan. Electrical Flows for Polylogarithmic Competitive Oblivious Routing. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 55:1-55:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ITCS.2024.55

Abstract

Oblivious routing is a well-studied paradigm that uses static precomputed routing tables for selecting routing paths within a network. Existing oblivious routing schemes with polylogarithmic competitive ratio for general networks are tree-based, in the sense that routing is performed according to a convex combination of trees. However, this restriction to trees leads to a construction that has time quadratic in the size of the network and does not parallelize well. In this paper we study oblivious routing schemes based on electrical routing. In particular, we show that general networks with n vertices and m edges admit a routing scheme that has competitive ratio O(log² n) and consists of a convex combination of only O(√m) electrical routings. This immediately leads to an improved construction algorithm with time Õ(m^{3/2}) that can also be implemented in parallel with Õ(√m) depth.

Subject Classification

ACM Subject Classification
  • Theory of computation → Routing and network design problems
Keywords
  • oblivious routing
  • electrical flows

Metrics

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

Related Versions

References

  1. Ittai Abraham, Yair Bartal, and Ofer Neiman. Nearly tight low stretch spanning trees. In Symposium on Foundations of Computer Science (FOCS), pages 781-790, 2008. URL: https://doi.org/10.1109/FOCS.2008.62.
  2. David Applegate and Edith Cohen. Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. In Symposium on Communications Architectures & Protocols (SIGCOMM), pages 313-324, 2003. URL: https://doi.org/10.1145/863955.863991.
  3. Sanjeev Arora, Elad Hazan, and Satyen Kale. The multiplicative weights update method: a meta-algorithm and applications. Theory of Computing, 8(6):121-164, 2012. URL: https://doi.org/10.4086/toc.2012.v008a006.
  4. Kyriakos Axiotis, Aleksander Madry, and Adrian Vladu. Circulation control for faster minimum cost flow in unit-capacity graphs. In Symposium on Foundations of Computer Science (FOCS), pages 93-104, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00018.
  5. Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. In Symposium on Theory of Computing (STOC), pages 273-282, 2011. URL: https://doi.org/10.1145/1993636.1993674.
  6. Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, and Guanghao Ye. Nested dissection meets ipms: Planar min-cost flow in nearly-linear time. In Symposium on Discrete Algorithms (SODA), pages 124-153, 2022. URL: https://doi.org/10.1137/1.9781611977073.7.
  7. Matthias Englert and Harald Räcke. Oblivious routing for the lp-norm. In Symposium on Foundations of Computer Science (FOCS), pages 32-40, 2009. URL: https://doi.org/10.1109/FOCS.2009.52.
  8. Jittat Fakcharoenphol, Satish B. Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Symposium on Theory of Computing (STOC), pages 448-455, 2003. URL: https://doi.org/10.1145/780542.780608.
  9. Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, and Mingquan Ye. Minor sparsifiers and the distributed laplacian paradigm. In Symposium on Foundations of Computer Science (FOCS), pages 989-999, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00099.
  10. Yu Gao, Yang P. Liu, and Richard Peng. Fully dynamic electrical flows: Sparse maxflow faster than goldberg-rao. In Symposium on Foundations of Computer Science (FOCS), pages 516-527, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00058.
  11. Mohsen Ghaffari, Bernhard Haeupler, and Goran Zuzic. Hop-constrained oblivious routing. In Symposium on Theory of Computing (STOC), 2021. URL: https://doi.org/10.1145/3406325.3451098.
  12. Bernhard Haeupler, Harald Räcke, and Mohsen Ghaffari. Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. In Symposium on Theory of Computing (STOC), pages 1325-1338, 2022. URL: https://doi.org/10.1145/3519935.3520026.
  13. Chris Harrelson, Kirsten Hildrum, and Satish B. Rao. A polynomial-time tree decomposition to minimize congestion. In Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 34-43, 2003. URL: https://doi.org/10.1145/777412.777419.
  14. Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, and Jaikumar Radhakrishnan. Minimizing average latency in oblivious routing. In Symposium on Discrete Algorithms (SODA), pages 200-207, 2008. URL: http://dl.acm.org/citation.cfm?id=1347082.1347105.
  15. Piotr Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM, 53(3):307-323, 2006. URL: https://doi.org/10.1145/1147954.1147955.
  16. Jonathan A. Kelner, Yin Tat Lee, Lorenzo Orecchia, and Aaron Sidford. An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations. In Symposium on Discrete Algorithms (SODA), pages 217-226, 2014. URL: https://doi.org/10.1137/1.9781611973402.16.
  17. Jonathan A. Kelner and Petar Maymounkov. Electric routing and concurrent flow cutting. Theor. Comput. Sci., 412(32):4123-4135, 2011. URL: https://doi.org/10.1016/j.tcs.2010.06.013.
  18. Praveen Kumar, Yang Yuan, Chris Yu, Nate Foster, Robert Kleinberg, Petr Lapukhov, Chiun Lin Lim, and Robert Soulé. Semi-oblivious traffic engineering: The road not taken. In USENIX Conference on Networked Systems Design and Implementation, pages 157-170, 2018. URL: https://www.usenix.org/conference/nsdi18/presentation/kumar.
  19. Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, and Daniel A. Spielman. Sparsified cholesky and multigrid solvers for connection laplacians. In Symposium on Theory of Computing (STOC), pages 842-850, 2016. URL: https://doi.org/10.1145/2897518.2897640.
  20. Gregory Lawler and Hariharan Narayanan. Mixing times and lp bounds for oblivious routing. In Meeting on Analytic Algorithmics and Combinatorics (ANALCO), pages 66-74, 2009. URL: https://doi.org/10.1137/1.9781611972993.10.
  21. Yin Tat Lee, Satish Rao, and Nikhil Srivastava. A new approach to computing maximum flows using electrical flows. In Symposium on Theory of Computing (STOC), pages 755-764, 2013. URL: https://doi.org/10.1145/2488608.2488704.
  22. Huan Li and Aaron Schild. Spectral subspace sparsification. In Symposium on Foundations of Computer Science (FOCS), pages 385-396, 2018. URL: https://doi.org/10.1109/FOCS.2018.00044.
  23. Aleksander Madry. Computing maximum flow with augmenting electrical flows. In Symposium on Foundations of Computer Science (FOCS), pages 593-602, 2016. URL: https://doi.org/10.1109/FOCS.2016.70.
  24. Richard Peng. Approximate undirected maximum flows in O(mpolylog(n)) time. In Symposium on Discrete Algorithms (SODA), pages 1862-1867, 2016. URL: https://doi.org/10.1137/1.9781611974331.CH130.
  25. Richard Peng and Daniel A. Spielman. An efficient parallel solver for SDD linear systems. In Symposium on Theory of Computing (STOC), pages 333-342, 2014. URL: https://doi.org/10.1145/2591796.2591832.
  26. Harald Räcke. Minimizing congestion in general networks. In Symposium on Foundations of Computer Science (FOCS), pages 43-52, 2002. URL: https://doi.org/10.1109/SFCS.2002.1181881.
  27. Harald Räcke. Optimal hierarchical decompositions for congestion minimization in networks. In Symposium on Theory of Computing (STOC), pages 255-264, 2008. URL: https://doi.org/10.1145/1374376.1374415.
  28. Harald Räcke, Chintan Shah, and Hanjo Täubig. Computing cut-based hierarchical decompositions in almost linear time. In Symposium on Discrete Algorithms (SODA), pages 227-238, 2014. URL: https://doi.org/10.1137/1.9781611973402.17.
  29. Harald Räcke, Chintan Shah, and Hanjo Täubig. Computing cut-based hierarchical decompositions in almost linear time. In Chandra Chekuri, editor, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 227-238. SIAM, 2014. Google Scholar
  30. Aaron Schild. An almost-linear time algorithm for uniform random spanning tree generation. In Symposium on Theory of Computing (STOC), pages 214-227, 2018. URL: https://doi.org/10.1145/3188745.3188852.
  31. Aaron Schild, Satish Rao, and Nikhil Srivastava. Localization of electrical flows. In Symposium on Discrete Algorithms (SODA), pages 1577-1584, 2018. URL: https://doi.org/10.1137/1.9781611975031.103.
  32. Aaron Sidford and Yin Tat Lee. Personal communication, 2022. Google Scholar
  33. Ali Sinop, Lisa Fawcett, Sreenivas Gollapudi, and Kostas Kollias. Robust routing using electrical flows. In Conference on Advances in Geographic Information Systems (SIGSPATIAL), 2021. URL: https://doi.org/10.1145/3474717.3483961.
  34. Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Symposium on Theory of Computing (STOC), pages 81-90, 2004. URL: https://doi.org/10.1145/1007352.1007372.
  35. Leslie G. Valiant and Gordon J. Brebner. Universal schemes for parallel communication. In Symposium on Theory of Computing (STOC), pages 263-277, 1981. URL: https://doi.org/10.1145/800076.802479.
  36. Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, and Aaron Sidford. Faster maxflow via improved dynamic spectral vertex sparsifiers. In Symposium on Foundations of Computer Science (FOCS), pages 543-556, 2022. URL: https://doi.org/10.1145/3519935.3520068.
  37. Goran Zuzic, Bernhard Haeupler, and Antti Roeyskoe. Sparse semi-oblivious routing: Few random paths suffice, 2023. URL: https://arxiv.org/abs/2301.06647.
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