Sparse Semi-Oblivious Routing: Few Random Paths Suffice

DOI10.1145/3583668.3594585arXiv2301.06647OpenAlexW4380880017MaRDI QIDQ6202250

Bernhard Haeupler, Goran Zuzic, Unnamed Author

Publication date: 26 March 2024

Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.06647

zbMATH Keywords

oblivious routingpacket routingsemi-oblivious routing

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Routing, merging, and sorting on parallel models of computation
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Packet routing in fixed-connection networks: A survey
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Negative association of random variables, with applications
• Tight bounds for oblivious routing in the hypercube
• Survey on Oblivious Routing Strategies
• Oblivious network design
• Efficient Schemes for Parallel Communication
• Efficient dispersal of information for security, load balancing, and fault tolerance
• On-line routing in all-optical networks
• Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
• Optimal Oblivious Path Selection on the Mesh
• Oblivious Routing for the Lp-norm
• Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
• Hop-constrained oblivious routing

This page was built for publication: Sparse Semi-Oblivious Routing: Few Random Paths Suffice