Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Polylog-Competitive Deterministic Local Routing and Scheduling (2403.07410v2)

Published 12 Mar 2024 in cs.DC

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 guarantee a polylog-competitive completion-time $\textbf{deterministically}$: 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 select a single good path from those candidates for each packet. 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 because congestion caused by ineffective candidate paths can be treated as noise. 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (66)
  1. Fast distributed network decompositions and covers. Journal of parallel and distributed computing, 39(2):105–114, 1996.
  2. Hyperx: topology, routing, and packaging of efficient large-scale networks. In Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, pages 1–11, 2009.
  3. Deterministic distributed algorithms and lower bounds in the hybrid model. arXiv preprint arXiv:2108.01740, 2021.
  4. An o(n log n) sorting network. In Proceedings of the fifteenth annual ACM symposium on Theory of computing, pages 1–9, 1983.
  5. Brief announcement: Almost universally optimal distributed laplacian solver. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, PODC’22, page 372–374, New York, NY, USA, 2022. Association for Computing Machinery.
  6. The probabilistic method. John Wiley & Sons, 2016.
  7. Kenneth E Batcher. Sorting networks and their applications. In Proceedings of the April 30–May 2, 1968, spring joint computer conference, pages 307–314, 1968.
  8. Complexity classes in communication complexity theory (preliminary version). In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986, pages 337–347. IEEE Computer Society, 1986.
  9. Asymptotically optimal algorithms for job shop scheduling and packet routing. Journal of Algorithms, 33(2):296–318, 1999.
  10. Optimal oblivious routing in hole-free networks. In International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, pages 421–437. Springer, 2010.
  11. Oblivious routing on geometric networks. In Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, pages 316–324, 2005.
  12. Optimal oblivious path selection on the mesh. IEEE Transactions on Computers, 57(5):660–671, 2008.
  13. Distributed greedy coding-aware deterministic routing for multi-flow in wireless networks. Computer Networks, 105:194–206, 2016.
  14. Greedy packet scheduling. SIAM Journal on Computing, 24(1):148–157, 1995.
  15. A time hierarchy theorem for the local model. SIAM Journal on Computing, 48(1):33–69, 2019.
  16. Deterministic distributed expander decomposition and routing with applications in distributed derandomization. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 377–388. IEEE, 2020.
  17. Hypercube-derived computers. The SIMD Model of Parallel Computation, pages 69–77, 1994.
  18. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(1):32–53, 1986.
  19. Philipp Czerner. Semi-oblivious routing strategies in directed graphs. 2020.
  20. Oblivious routing for the lp-norm. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pages 32–40. IEEE, 2009.
  21. Improved bounds for acyclic job shop scheduling. Comb., 22(3):361–399, 2002.
  22. Mario Gerla. 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, pages 23–28, 1973.
  23. Faster deterministic distributed MIS and approximate matching. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 1777–1790, 2023.
  24. 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), pages 202–219, 2016.
  25. Low-congestion shortcuts for graphs excluding dense minors. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, PODC’21, page 213–221, New York, NY, USA, 2021. Association for Computing Machinery.
  26. Mohsen Ghaffari. Near-optimal scheduling of distributed algorithms. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pages 3–12, 2015.
  27. Mohsen Ghaffari. Network decomposition and distributed derandomization. In International Colloquium on Structural Information and Communication Complexity, pages 3–18. Springer, 2020.
  28. Oblivious network design. In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 970–979, 2006.
  29. Hop-constrained oblivious routing. In STOC ’21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 1208–1220. ACM, 2021.
  30. A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM Journal on Computing, 27(1):302–316, 1998.
  31. Distributed MST and routing in almost mixing time. In Proceedings of the ACM Symposium on Principles of Distributed Computing, pages 131–140, 2017.
  32. New distributed algorithms in almost mixing time via transformations from parallel algorithms. arXiv preprint arXiv:1805.04764, 2018.
  33. Better approximation guarantees for job-shop scheduling. SIAM J. Discret. Math., 14(1):67–92, 2001.
  34. Universally-optimal distributed exact min-cut. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, pages 281–291, 2022.
  35. Near-Optimal Schedules for Simultaneous Multicasts. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), volume 198 of Leibniz International Proceedings in Informatics (LIPIcs), pages 78:1–78:19, Dagstuhl, Germany, 2021. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
  36. Near-optimal low-congestion shortcuts on bounded parameter graphs. In International Symposium on Distributed Computing, pages 158–172. Springer, 2016.
  37. 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, pages 929–938. SIAM, 2007.
  38. Minor excluded network families admit fast distributed algorithms. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pages 465–474, 2018.
  39. Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 1325–1338, 2022.
  40. Network coding gaps for completion times of multiple unicasts. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 494–505. IEEE, 2020.
  41. Universally-optimal distributed algorithms for known topologies. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1166–1179, 2021.
  42. Tight bounds for oblivious routing in the hypercube. Math. Syst. Theory, 24(4):223–232, 1991.
  43. Semi-oblivious traffic engineering with smore. In Proceedings of the Applied Networking Research Workshop, ser. ANRW, volume 18, page 21, 2018.
  44. 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, pages 157–170. USENIX Association, 2018.
  45. Christoph Lenzen. 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, pages 42–50. ACM, 2013.
  46. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Comb., 14(2):167–186, 1994.
  47. Randomized routing and sorting on fixed-connection networks. Journal of Algorithms, 17(1):157–205, 1994.
  48. Hypercubic sorting networks. SIAM Journal on Computing, 27(1):1–47, 1998.
  49. Friedhelm Meyer auf der Heide and Berthold Vöcking. A packet routing protocol for arbitrary networks. In STACS, pages 291–302, 1995.
  50. Bruce M Maggs. A survey of congestion+ dilation results for packet scheduling. In 2006 40th Annual Conference on Information Sciences and Systems, pages 1505–1510. IEEE, 2006.
  51. Greedy packet scheduling on shortest paths. In Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, pages 165–175, 1991.
  52. Hardness of approximating flow and job shop scheduling problems. J. ACM, 58(5):20:1–20:32, 2011.
  53. Universal o (congestion+ dilation+ log1+ ε𝜀\varepsilonitalic_ε n) local control packet switching algorithms. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 644–653, 1997.
  54. David Peleg. Distributed computing: a locality-sensitive approach. SIAM, 2000.
  55. Michael Pinedo. Scheduling: Theory, Algorithms, and Systems. Springer New York, New York, NY, 6th edition, 2022.
  56. On the complexity of distributed network decomposition. Journal of Algorithms, 20(2):356–374, 1996.
  57. Michael O Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM (JACM), 36(2):335–348, 1989.
  58. Harald Räcke. 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, pages 255–264. ACM, 2008.
  59. Undirected (1+ε)1𝜀(1+\varepsilon)( 1 + italic_ε )-shortest paths via minor-aggregates: Near-optimal deterministic parallel & distributed algorithms. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 478–487, 2022.
  60. Compact oblivious routing. In 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, volume 144 of LIPIcs, pages 75:1–75:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
  61. Exploiting locality in distributed SDN control. In Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking, pages 121–126, 2013.
  62. Improved approximation algorithms for shop scheduling problems. SIAM Journal on Computing, 23(3):617–632, June 1994.
  63. A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 636–643, 1997.
  64. Leslie G. Valiant. A scheme for fast parallel communication. SIAM journal on computing, 11(2):350–361, 1982.
  65. Universally-optimal distributed shortest paths and transshipment via graph-based L1-oblivious routing. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, pages 2549–2579, 2022.
  66. Sparse semi-oblivious routing: Few random paths suffice. In Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, pages 222–232, 2023.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now