Cookies?
Library Header Image
LSE Research Online LSE Library Services

Dynamic vs Oblivious Routing in Network Design

Goyal, Navin, Olver, Neil and Bruce Shepherd, F. (2010) Dynamic vs Oblivious Routing in Network Design. Algorithmica, 61 (1). 161 - 173. ISSN 0178-4617

Full text not available from this repository.

Identification Number: 10.1007/s00453-010-9455-4

Abstract

Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impact of different routing models in this robust setting: in particular, we compare oblivious routing, where the routing between each terminal pair must be fixed in advance, to dynamic routing, where routings may depend arbitrarily on the current demand. Our main result is a construction that shows that the optimal cost of such a network based on oblivious routing (fractional or integral) may be a factor of (log n) more than the cost required when using dynamic routing. This is true even in the important special case of the asymmetric hose model. This answers a question in (Chekuri, SIGACT News 38(3):106–128, 2007), and is tight up to constant factors. Our proof technique builds on a connection between expander graphs and robust design for single-sink traffic patterns (Chekuri et al., Networks 50(1):50–54, 2007).

Item Type: Article
Official URL: https://link.springer.com/journal/453
Additional Information: © 2010 Springer Science+Business Media, LLC.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 21 Jan 2020 00:27
Last Modified: 21 Jan 2020 00:27
URI: http://eprints.lse.ac.uk/id/eprint/103088

Actions (login required)

View Item View Item