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).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abraham, I., Bartal, Y., Neiman, O.: Nearly tight low stretch spanning trees. In: Proc. of IEEE FOCS, pp. 781–790 (2008)
Andrews, M.: Hardness of buy-at-bulk network design. In: Proc. of IEEE FOCS, pp. 115–124 (2004)
Andrews, M.: Private communication (2010)
Bartal, Y., Leonardi, S.: On-line routing in all-optical networks. Theor. Comput. Sci. 221(1–2), 19–39 (1999)
Ben-Ameur, W., Kerivin, H.: New economical virtual private networks. Commun. ACM 46(6), 69–73 (2003)
Chekuri, C.: Routing and network design with robustness to changing or uncertain traffic demands. SIGACT News 38(3), 106–128 (2007)
Chekuri, C., Oriolo, G., Scutella, M.G., Shepherd, F.B.: Hardness of robust network design. Networks 50(1), 50–54 (2007)
Eisenbrand, F., Grandoni, F., Rothvoß, T., Schäfer, G.: Approximating connected facility location problems via random facility sampling and core detouring. In: Proc. of ACM-SIAM SODA, pp. 1174–1183 (2008)
Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485–497 (2004)
Fingerhut, A.J., Suri, S., Turner, J.S.: Designing least-cost nonblocking broadband networks. J. Algorithms 24(2), 287–309 (1997)
Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow. In: Proc. of ACM STOC, pp. 389–398 (2001)
Gupta, A., Kumar, A., Pál, M., Roughgarden, T.: Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM 54(3), 11 (2007)
Hajiaghayi, M., Kleinberg, R., Räcke, H., Leighton, T.: Oblivious routing on node-capacitated and directed graphs. ACM Trans. Algorithms 3(4), 51 (2007)
Maggs, B.M., Meyer aud der Heide, F., Vöcking, B., Westerman, M.: Exploiting locality for networks of limited bandwidth. In: Proc. of IEEE FOCS, pp. 284–293 (1997)
Matousek, J.: Lectures on Discrete Geometry. Springer, Berlin (2002)
Olver, N., Shepherd, F.B.: Approximability of robust network design. In: Proc. of ACM-SIAM SODA, pp. 1097–1105 (2010)
Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245–269 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Goyal, N., Olver, N. & Bruce Shepherd, F. Dynamic vs. Oblivious Routing in Network Design. Algorithmica 61, 161–173 (2011). https://doi.org/10.1007/s00453-010-9455-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-010-9455-4