Polylog-Competitive Deterministic Local Routing and Scheduling
Authors: 
Bernhard Haeupler, 
Shyamal Patel, Antti Roeyskoe, 
Cliff Stein, 
Goran ZuzicAuthors Info & Claims
Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran ZuzicAuthors Info & ClaimsPages 812 - 822
Abstract
This paper addresses point-to-point packet routing in undirected networks, which is the most important communication primitive in most networks. The main result proves the existence of routing tables that deterministically guarantee a polylog-competitive completion-time:
In any undirected network, it is possible to give each node simple stateless deterministic local forwarding rules, such that, any adversarially chosen set of packets are delivered as fast as possible, up to polylog factors.
All previous routing strategies crucially required randomization for both route selection and packet scheduling. The core technical contribution of this paper is a new local packet scheduling result of independent interest. This scheduling strategy integrates well with recent sparse semi-oblivious path selection strategies. Such strategies deterministically select not one but several candidate paths for each packet and require a global coordinator to know all packets to adaptively select a single good path from those candidates for each packet. Of course, global knowledge of all packets is exactly what local routing tables cannot have. Another challenge is that, even if a single path is selected for each packet, no strategy for scheduling packets along low-congestion paths that is both local and deterministic is known. Our novel scheduling strategy utilizes the fact that every semi-oblivious routing strategy uses only a small (polynomial) subset of candidate routes. It overcomes the issue of global coordination by furthermore being provably robust to adversarial noise. This avoids the issue of having to choose a single path per packet by treating congestion caused by ineffective candidate paths as noise. Beyond more efficient routing tables, our results can be seen as making progress on fundamental questions regarding the importance and power of randomization in network communications and distributed computing. For example, our results imply the first deterministic universally-optimal algorithms in the distributed supported-CONGEST model for many important global distributed tasks, including computing minimum spanning trees, approximate shortest paths, and part-wise aggregates.
References
[1]
Jung Ho Ahn, Nathan L. Binkert, Al Davis, Moray McLaren, and Robert S. Schreiber. 2009. HyperX: topology, routing, and packaging of efficient large-scale networks. In Proceedings of the ACM/IEEE Conference on High Performance Computing, SC 2009, November 14-20, 2009, Portland, Oregon, USA. ACM. https://doi.org/10.1145/1654059.1654101
[2]
Miklós Ajtai, János Komlós, and Endre Szemerédi. 1983. An O(n log n) Sorting Network. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM, 1–9. https://doi.org/10.1145/800061.808726
[3]
Noga Alon and Joel Spencer. 1992. The Probabilistic Method. John Wiley. isbn:0-471-53588-5 http://cs.nyu.edu/cs/faculty/spencer/nogabook/nogabook.html
[4]
Ioannis Anagnostides and Themis Gouleakis. 2021. Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. In 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), Seth Gilbert (Ed.) (LIPIcs, Vol. 209). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 5:1–5:19. https://doi.org/10.4230/LIPICS.DISC.2021.5
[5]
Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, and Themis Gouleakis. 2022. Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (PODC’22). Association for Computing Machinery, New York, NY, USA. 372–374. isbn:9781450392624 https://doi.org/10.1145/3519270.3538464
[6]
Friedhelm Meyer auf der Heide and Berthold Vöcking. 1995. A Packet Routing Protocol for Arbitrary Networks. In STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings (Lecture Notes in Computer Science, Vol. 900). Springer, 291–302. https://doi.org/10.1007/3-540-59042-0_81
[7]
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, and David Peleg. 1996. Fast Distributed Network Decompositions and Covers. J. Parallel Distributed Comput., 39, 2 (1996), 105–114. https://doi.org/10.1006/JPDC.1996.0159
[8]
Kenneth E. Batcher. 1968. Sorting Networks and Their Applications. In American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1968 Spring Joint Computer Conference, Atlantic City, NJ, USA, 30 April - 2 May 1968 (AFIPS Conference Proceedings, Vol. 32). Thomson Book Company, Washington D.C., 307–314. https://doi.org/10.1145/1468075.1468121
[9]
Dimitris Bertsimas and David Gamarnik. 1999. Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing. J. Algorithms, 33, 2 (1999), 296–318. https://doi.org/10.1006/JAGM.1999.1047
[10]
Costas Busch and Malik Magdon-Ismail. 2010. Optimal Oblivious Routing in Hole-Free Networks. In Quality, Reliability, Security and Robustness in Heterogeneous Networks - 7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine. 74, Springer, 421–437. https://doi.org/10.1007/978-3-642-29222-4_30
[11]
Costas Busch, Malik Magdon-Ismail, and Jing Xi. 2005. Oblivious routing on geometric networks. In SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA. ACM, 316–324. https://doi.org/10.1145/1073970.1074022
[12]
Costas Busch, Malik Magdon-Ismail, and Jing Xi. 2008. Optimal Oblivious Path Selection on the Mesh. IEEE Trans. Computers, 57, 5 (2008), 660–671. https://doi.org/10.1109/TC.2008.23
[13]
Yi-Jun Chang and Seth Pettie. 2019. A Time Hierarchy Theorem for the LOCAL Model. SIAM J. Comput., 48, 1 (2019), 33–69. https://doi.org/10.1137/17M1157957
[14]
Yi-Jun Chang and Thatchaphol Saranurak. 2020. Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020. IEEE, 377–388. https://doi.org/10.1109/FOCS46700.2020.00043
[15]
Jing Chen, Kun He, Quan Yuan, Ruiying Du, Lina Wang, and Jie Wu. 2016. Distributed Greedy Coding-aware Deterministic Routing for multi-flow in wireless networks. Comput. Networks, 105 (2016), 194–206. https://doi.org/10.1016/J.COMNET.2016.05.027
[16]
Israel Cidon, Shay Kutten, Yishay Mansour, and David Peleg. 1995. Greedy Packet Scheduling. SIAM J. Comput., 24, 1 (1995), 148–157. https://doi.org/10.1137/S0097539791217695
[17]
Robert Cypher, Jorge LC Sanz, Robert Cypher, and Jorge LC Sanz. 1994. Hypercube-Derived Computers. The SIMD Model of Parallel Computation, 69–77.
[18]
Philipp Czerner. 2020. Semi-oblivious Routing Strategies in Directed Graphs. https://nicze.de/philipp/msc_thesis.pdf
[19]
Matthias Englert and Harald Räcke. 2009. Oblivious Routing for the Lp-norm. In 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA. IEEE Computer Society, 32–40. https://doi.org/10.1109/FOCS.2009.52
[20]
Juan A. Garay, Shay Kutten, and David Peleg. 1998. A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM J. Comput., 27, 1 (1998), 302–316. https://doi.org/10.1137/S0097539794261118
[21]
Mario Gerla. 1973. Deterministic and adaptive routing policies in packet-switched computer networks. In Proceedings of the third ACM Symposium on Data Communications and Data Networks - Analysis and Design, DATACOMM 1973, USA, 1973. ACM, 23–28. https://doi.org/10.1145/800280.811026
[22]
Mohsen Ghaffari. 2015. Near-Optimal Scheduling of Distributed Algorithms. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastián, Spain, July 21 - 23, 2015. ACM, 3–12. https://doi.org/10.1145/2767386.2767417
[23]
Mohsen Ghaffari. 2021. Network Decomposition and Distributed Derandomization. In ICDCN ’21: International Conference on Distributed Computing and Networking, Virtual Event, Nara, Japan, January 5-8, 2021. ACM, 1. https://doi.org/10.1145/3427796.3433934
[24]
Mohsen Ghaffari and Christoph Grunau. 2023. Faster Deterministic Distributed MIS and Approximate Matching. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing. 1777–1790.
[25]
Mohsen Ghaffari and Bernhard Haeupler. 2016. Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016. SIAM, 202–219. https://doi.org/10.1137/1.9781611974331.CH16
[26]
Mohsen Ghaffari and Bernhard Haeupler. 2021. Low-Congestion Shortcuts for Graphs Excluding Dense Minors. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC’21). Association for Computing Machinery, New York, NY, USA. 213–221. isbn:9781450385480 https://doi.org/10.1145/3465084.3467935
[27]
Mohsen Ghaffari, Bernhard Haeupler, and Goran Zuzic. 2021. Hop-constrained oblivious routing. In STOC ’21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021. ACM, 1208–1220. https://doi.org/10.1145/3406325.3451098
[28]
Mohsen Ghaffari, Fabian Kuhn, and Hsin-Hao Su. 2017. Distributed MST and Routing in Almost Mixing Time. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017. ACM, 131–140. https://doi.org/10.1145/3087801.3087827
[29]
Mohsen Ghaffari and Jason Li. 2018. New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. 121 (2018), 31:1–31:16. https://doi.org/10.4230/LIPICS.DISC.2018.31
[30]
Mohsen Ghaffari and Goran Zuzic. 2022. Universally-Optimal Distributed Exact Min-Cut. In PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022. ACM, 281–291. https://doi.org/10.1145/3519270.3538429
[31]
Anupam Gupta, Mohammad Taghi Hajiaghayi, and Harald Räcke. 2006. Oblivious network design. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. ACM Press, 970–979. http://dl.acm.org/citation.cfm?id=1109557.1109665
[32]
Bernhard Haeupler, D. Ellis Hershkowitz, and David Wajc. 2021. Near-Optimal Schedules for Simultaneous Multicasts. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 198). Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany. 78:1–78:19. isbn:978-3-95977-195-5 issn:1868-8969 https://doi.org/10.4230/LIPIcs.ICALP.2021.78
[33]
Bernhard Haeupler, Taisuke Izumi, and Goran Zuzic. 2016. Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. In Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings (Lecture Notes in Computer Science, Vol. 9888). Springer, 158–172. https://doi.org/10.1007/978-3-662-53426-7_12
[34]
Bernhard Haeupler, Jason Li, and Goran Zuzic. 2018. Minor Excluded Network Families Admit Fast Distributed Algorithms. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018. ACM, 465–474. https://dl.acm.org/citation.cfm?id=3212776
[35]
Bernhard Haeupler, Harald Räcke, and Mohsen Ghaffari. 2022. Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. In STOC ’22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. ACM, 1325–1338. https://doi.org/10.1145/3519935.3520026
[36]
Bernhard Haeupler, David Wajc, and Goran Zuzic. 2020. Network Coding Gaps for Completion Times of Multiple Unicasts. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020. IEEE, 494–505. https://doi.org/10.1109/FOCS46700.2020.00053
[37]
Bernhard Haeupler, David Wajc, and Goran Zuzic. 2021. Universally-optimal distributed algorithms for known topologies. In STOC ’21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021. ACM, 1166–1179. https://doi.org/10.1145/3406325.3451081
[38]
Mohammad Taghi Hajiaghayi, Robert Kleinberg, and Tom Leighton. 2007. Semi-oblivious routing: lower bounds. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. SIAM, 929–938. http://dl.acm.org/citation.cfm?id=1283383.1283483
[39]
Christos Kaklamanis, Danny Krizanc, and Thanasis Tsantilas. 1991. Tight Bounds for Oblivious Routing in the Hypercube. Math. Syst. Theory, 24, 4 (1991), 223–232. https://doi.org/10.1007/BF02090400
[40]
Praveen Kumar, Yang Yuan, Chris Yu, Nate Foster, Robert Kleinberg, Petr Lapukhov, Chiunlin Lim, and Robert Soulé. 2018. Semi-Oblivious Traffic Engineering: The Road Not Taken. In 15th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2018, Renton, WA, USA, April 9-11, 2018. USENIX Association, 157–170. https://www.usenix.org/conference/nsdi18/presentation/kumar
[41]
Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, and Satish Rao. 1994. Randomized Routing and Sorting on Fixed-Connection Networks. J. Algorithms, 17, 1 (1994), 157–205. https://doi.org/10.1006/JAGM.1994.1030
[42]
Frank Thomson Leighton, Bruce M. Maggs, and Satish Rao. 1994. Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps. Comb., 14, 2 (1994), 167–186. https://doi.org/10.1007/BF01215349
[43]
Frank Thomson Leighton and C. Greg Plaxton. 1998. Hypercubic Sorting Networks. SIAM J. Comput., 27, 1 (1998), 1–47. https://doi.org/10.1137/S0097539794268406
[44]
Christoph Lenzen. 2013. Optimal deterministic routing and sorting on the congested clique. In ACM Symposium on Principles of Distributed Computing, PODC ’13, Montreal, QC, Canada, July 22-24, 2013. ACM, 42–50. https://doi.org/10.1145/2484239.2501983
[45]
Bruce M. Maggs. 2006. A Survey of Congestion+Dilation Results for Packet Scheduling. In 40th Annual Conference on Information Sciences and Systems, CISS 2006, Princeton, NJ, USA, 22-24 March 2006. IEEE, 1505–1510. https://doi.org/10.1109/CISS.2006.286378
[46]
Yishay Mansour and Boaz Patt-Shamir. 1993. Greedy Packet Scheduling on Shortest Paths. J. Algorithms, 14, 3, 449–465. https://doi.org/10.1006/JAGM.1993.1024
[47]
Rafail Ostrovsky and Yuval Rabani. 1997. Universal O(Congestion + Dilation + log^ 1+epsilonN) Local Control Packet Switching Algorithms. In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997. ACM, 644–653. https://doi.org/10.1145/258533.258659
[48]
Alessandro Panconesi and Aravind Srinivasan. 1996. On the Complexity of Distributed Network Decomposition. J. Algorithms, 20, 2 (1996), 356–374. https://doi.org/10.1006/JAGM.1996.0017
[49]
Michael O. Rabin. 1989. Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM, 36, 2 (1989), 335–348. https://doi.org/10.1145/62044.62050
[50]
Harald Räcke. 2008. Optimal hierarchical decompositions for congestion minimization in networks. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008. ACM, 255–264. https://doi.org/10.1145/1374376.1374415
[51]
Harald Räcke and Stefan Schmid. 2019. Compact Oblivious Routing. In 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany (LIPIcs, Vol. 144). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 75:1–75:14. https://doi.org/10.4230/LIPIcs.ESA.2019.75
[52]
Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, and Jason Li. 2022. Undirected (1+∊ )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. In STOC ’22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. ACM, 478–487. https://doi.org/10.1145/3519935.3520074
[53]
Stefan Schmid and Jukka Suomela. 2013. Exploiting locality in distributed SDN control. In Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN 2013, The Chinese University of Hong Kong, Hong Kong, China, Friday, August 16, 2013. ACM, 121–126. https://doi.org/10.1145/2491185.2491198
[54]
Aravind Srinivasan and Chung-Piaw Teo. 2000. A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria. SIAM J. Comput., 30, 6, 2051–2068. https://doi.org/10.1137/S0097539798335596
[55]
Leslie G. Valiant. 1982. A Scheme for Fast Parallel Communication. SIAM J. Comput., 11, 2 (1982), 350–361. https://doi.org/10.1137/0211027
[56]
Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, and Xiaorui Sun. 2022. Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms. 2549–2579. https://doi.org/10.1137/1.9781611977073.100
[57]
Goran Zuzic, Bernhard Haeupler, and Antti Roeyskoe. 2023. Sparse Semi-Oblivious Routing: Few Random Paths Suffice. In Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023. ACM, 222–232. https://doi.org/10.1145/3583668.3594585
Index Terms
- Polylog-Competitive Deterministic Local Routing and Scheduling
Recommendations
Source routing and scheduling in packet networks
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of paths for these packets is admissible if no link in the network is ...
Better Deterministic Online Packet Routing on Grids
SPAA '15: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and ArchitecturesWe consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at any time. The ...
Delay Optimization Via Packet Scheduling for Multi-Path Routing in Wireless Networks
In this paper, the delay optimization problem of multi-path routing in wireless networks is studied. We propose a packet scheduling algorithm weighted shortest delay (WSD) for multi-path routing with the objective minimizing the total weighted delay of a ...
Comments
Information & Contributors
Information
Published In
June 2024
2049 pages
ISBN:9798400703836
DOI:10.1145/3618260
- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
Copyright © 2024 Copyright held by the owner/author(s).
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s).
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 June 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- NSF (National Science Foundation)
- European Research Council
- Office of Naval Research
Conference
STOC '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Upcoming Conference
STOC '25
- Sponsor:
- sigact
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 244Total Downloads
- Downloads (Last 12 months)244
- Downloads (Last 6 weeks)47
Reflects downloads up to 04 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in