Hop-Constrained Oblivious Routing
Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic

TL;DR
This paper introduces a new oblivious routing scheme that guarantees near-optimal combined congestion and dilation performance in polynomial time, resolving a longstanding open problem in network routing theory.
Contribution
It proves the existence of a polynomial-time, hop-constrained oblivious routing scheme with polylogarithmic competitiveness in congestion and dilation.
Findings
Achieves polylogarithmic competitiveness in congestion and dilation.
Provides a routing scheme with paths of length at most h·polylog(n).
Paths can be sampled efficiently in polynomial time.
Abstract
We prove the existence of an oblivious routing scheme that is -competitive in terms of , thus resolving a well-known question in oblivious routing. Concretely, consider an undirected network and a set of packets each with its own source and destination. The objective is to choose a path for each packet, from its source to its destination, so as to minimize , defined as follows: The dilation is the maximum path hop-length, and the congestion is the maximum number of paths that include any single edge. The routing scheme obliviously and randomly selects a path for each packet independent of (the existence of) the other packets. Despite this obliviousness, the selected paths have within a factor of the best possible value. More precisely, for any integer hop-bound…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Optimization and Search Problems · Advanced Graph Theory Research
