Sparse Semi-Oblivious Routing: Few Random Paths Suffice

01/17/2023
by   Goran Zuzic, et al.
0

The packet routing problem asks to select routing paths that minimize the maximum edge congestion for a set of packets specified by source-destination vertex pairs. We revisit a semi-oblivious approach to this problem: each source-destination pair is assigned a small set of predefined paths before the demand is revealed, while the sending rates along the paths can be optimally adapted to the demand. This approach has been considered in practice in network traffic engineering due to its superior robustness and performance as compared to both oblivious routing and traditional traffic engineering approaches. We show the existence of sparse semi-oblivious routings: only O(log n) paths are selected between each pair of vertices. The routing is (poly log n)-competitive for all demands against the offline-optimal congestion objective. Even for the well-studied case of hypercubes, no such result was known: our deterministic and oblivious selection of O(log n) paths is the first simple construction of a deterministic oblivious structure that near-optimally assigns source-destination pairs to few routes. Our results contrast the current solely-negative landscape of results for semi-oblivious routing. We give the sparsity-competitiveness trade-off for lower sparsities and nearly match it with a lower bound. Our construction is extremely simple: Sample the few paths from any competitive oblivious routing. Indeed, this natural construction was used in traffic engineering as an unproven heuristic. We give a satisfactory theoretical justification for their empirical effectiveness: the competitiveness of the construction improves exponentially with the number of paths. Finally, when combined with the recent hop-constrained oblivious routing, we also obtain sparse and competitive structures for the completion-time objective.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/20/2020

Hop-Constrained Oblivious Routing

We prove the existence of an oblivious routing scheme that is poly(log n...
research
09/25/2020

On the Approximability of Robust Network Design

Given the dynamic nature of traffic, we investigate the variant of robus...
research
10/25/2020

The Case for Hop-by-Hop Traffic Engineering

State-of-the-art Internet traffic engineering uses source-based explicit...
research
12/31/2019

Near-Optimal Schedules for Simultaneous Multicasts

We study the store-and-forward packet routing problem for simultaneous m...
research
06/24/2019

Hop-by-Hop Multipath Routing: Choosing the Right Nexthop Set

The Internet can be made more efficient and robust with hop-by-hop multi...
research
02/27/2019

Multiple Constrained Routing Algorithms in Large-Scaled Software Defined Networks

In this paper, we consider the bandwidth-delay-hop constrained routing p...
research
03/01/2023

Efficient Routing Algorithm Design for Large DetNet

Deterministic Networking (DetNet) is a rising technology that offers det...

Please sign up or login with your details

Forgot password? Click here to reset