Skip to main content

Models and Algorithms for Robust Network Design with Several Traffic Scenarios

  • Conference paper
Combinatorial Optimization (ISCO 2012)

Abstract

We consider a robust network design problem: optimum integral capacities need to be installed in a network such that supplies and demands in each of the explicitly known traffic scenarios can be satisfied by a single-commodity flow. In Buchheim et al. (LNCS 6701, 7–17 (2011)), an integer-programming (IP) formulation of polynomial size was given that uses both flow and capacity variables. We introduce an IP formulation that only uses capacity variables and exponentially many, but polynomial time separable constraints. We discuss the advantages of the latter formulation for branch-and-cut implemenations and evaluate preliminary computational results for the root bounds. We define a class of instances that is difficult for IP-based approaches. Finally, we design and implement a heuristic solution approach based on the exploration of large neighborhoods of carefully selected size and evaluate it on the difficult instances. The results are encouraging, with a good understanding of the trade-off between solution quality and neighborhood size.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altin, A., Amaldi, E., Belotti, P., Pinar, M.C.: Provisioning virtual private networks under traffic uncertainty. Networks 49(1), 100–115 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Avella, P., Mattia, S., Sassano, A.: Metric inequalities and the network loading problem. Discrete Optimization 4(1), 103–114 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ben-Ameur, W., Kerivin, H.: Routing of uncertain demands. Optimization and Engineering 3, 283–313 (2005)

    Article  MathSciNet  Google Scholar 

  4. Bienstock, D., Chopra, S., Günlük, O., Tsai, C.H.: Minimum cost capacity installation for multicommodity network flows. Math. Program. 81(2), 177–199 (1998)

    Article  MATH  Google Scholar 

  5. Buchheim, C., Liers, F., Oswald, M.: Local cuts revisited. Operations Research Letters 36(4), 430–433 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Buchheim, C., Liers, F., Sanità, L.: An Exact Algorithm for Robust Network Design. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 7–17. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Chekuri, C.: Routing and network design with robustness to changing or uncertain traffic demands. SIGACT News 38(3), 106–128 (2007)

    Article  MathSciNet  Google Scholar 

  8. Duffield, N.G., Goyal, P., Greenberg, A.G., Mishra, P.P., Ramakrishnan, K.K., van der Merwe, J.E.: A flexible model for resource management in virtual private networks. In: Proceedings of SIGCOMM, vol. 29, pp. 95–108 (1999)

    Google Scholar 

  9. Eisenbrand, F., Grandoni, F., Oriolo, G., Skutella, M.: New approaches for virtual private network design. SIAM Journal on Computing, 706–721 (2007)

    Google Scholar 

  10. Erlebach, T., Rüegg, M.: Optimal bandwidth reservation in hose-model VPNs with multi-path routing. In: Proceedings of INFOCOM, vol. 4, pp. 2275–2282 (2004)

    Google Scholar 

  11. Fingerhut, J.A., Suri, S., Turner, J.S.: Designing least-cost nonblocking broadband networks. Journal of Algorithms 24(2), 287–309 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  12. Fiorini, S., Oriolo, G., Sanità, L., Theis, D.O.: The VPN problem with concave costs. SIAM Journal on Discrete Mathematics, 1080–1090 (2010)

    Google Scholar 

  13. Goldberg, A.V.: An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms 22(1), 1–29 (1997)

    Article  MathSciNet  Google Scholar 

  14. Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proceedings of STOC, pp. 365–372 (2003)

    Google Scholar 

  15. Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21(1), 39–60 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ford Jr., L.R., Fulkerson, D.R.: A simple algorithm for finding maximal network flows and an application to the hitchcock problem. Canadian Journal of Mathematics 9, 210–218 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kerivin, H., Mahjoub, A.R.: Design of survivable networks: A survey. Networks, 1–21 (2005)

    Google Scholar 

  18. Koster, A.M.C.A., Kutschka, M., Raack, C.: Towards robust network design using integer linear programming techniques. In: NGI, pp. 1–8 (2010)

    Google Scholar 

  19. Magnanti, T.L., Raghavan, S.: Strong formulations for network design problems with connectivity requirements. Networks 45, 61–79 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  20. McCormick, S.T., Rao, M.R., Rinaldi, G.: Easy and difficult objective functions for max-cut. Math. Program. 94(2-3, Ser. B), 459–466 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  21. Raack, C., Koster, A.M.C.A., Orlowski, S., Wessäly, R.: On cut-based inequalities for capacitated network design polyhedra. Networks 57(2), 141–156 (2011)

    MathSciNet  MATH  Google Scholar 

  22. Sanità, L.: Robust Network Design. Ph.D. Thesis. Università La Sapienza, Roma (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Álvarez-Miranda, E. et al. (2012). Models and Algorithms for Robust Network Design with Several Traffic Scenarios. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds) Combinatorial Optimization. ISCO 2012. Lecture Notes in Computer Science, vol 7422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32147-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32147-4_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32146-7

  • Online ISBN: 978-3-642-32147-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics