Skip to main content
SpringerLink
Log in

Single-Layer Cuts for Multi-Layer Network Design Problems

  • Chapter
Telecommunications Modeling, Policy, and Technology

Part of the book series: Operations Research/Computer Science Interfaces ((ORCS,volume 44))

Abstract

We study a planning problem arising in SDH/WDM multi-layer telecommunication network design. The goal is to find a minimum cost installation of link and node hardware of both network layers such that traffic demands can be realized via grooming and a survivable routing. We present a mixed-integer programming formulation for a predefined set of admissible logical links that takes many practical side constraints into account, including node hardware, several bit-rates, and survivability against single physical node or link failures. This model is solved using a branch-and-cut approach with cutting planes based on either of the two layers. On several realistic two-layer planning scenarios, we show that these cutting planes are still useful in the multi-layer context, helping to increase the dual bound and to reduce the optimality gaps.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. T. Achterberg. Constraint Integer Programming. PhD thesis, Technische Universität Berlin, 2007. http://opus.kobv.de/tuberlin/volltexte/2007/1611/.

    Google Scholar 

  2. D. Alevras, M. Grötschel, and R. Wessäly. A network dimensioning tool. ZIB Technical Report SC-96-49, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 1996.

    Google Scholar 

  3. A. Atamtürk. On capacitated network design cut-set polyhedra. Mathematical Programming, 92:425–437, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  4. G. Baier, T. Engel, A. Autenrieth, and P. Leisching. Mehrperiodenplanung optischer Transportnetze. In 7. ITG-Fachtagung Photonische Netze, Leipzig, Germany, volume 193, pages 153–160. VDE-Verlag, April 2006.

    Google Scholar 

  5. A. Balakrishnan, T. Magnanti, J. Sokol, and Y. Wang. Modeling and solving the single facility line restoration problem. Technical report, MIT Press, 1998.

    Google Scholar 

  6. P. Belotti, A. Capone, G. Carello, F. Malucelli, F. Senaldi, and A. Totaro. Design of multi-layer networks with traffic grooming and statistical multiplexing. In Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium, April 2007.

    Google Scholar 

  7. D. Bienstock, S. Chopra, O. Günlük, and C.Y. Tsai. Mininum cost capacity installation for multicommodity flows. Mathematical Programming, 81:177–199, 1998.

    MathSciNet  Google Scholar 

  8. D. Bienstock and O. Günlük. Capacitated network design – polyhedral structure and computation. INFORMS Journal on Computing, 8(3):243–259, 1996.

    MATH  Google Scholar 

  9. D. Bienstock and G. Muratore. Strong inequalities for capacitated survivable network design problems. Mathematical Programming, 89(1):127–147, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  10. S. Chopra. On the spanning tree polyhedron. Operations Research Letters, 8:25–29, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  11. S. Chopra, I. Gilboa, and S. T. Sastry. Source sink flows with capacity installation in batches. Discrete Applied Mathematics, 86:165–192, 1998.

    Article  MathSciNet  Google Scholar 

  12. S. Chopra and M. Rao. The Steiner tree problem I: Formulations, compositions and extension of facets. Mathematical Programming, 64(2):209–229, 1994.

    Google Scholar 

  13. S. Chopra and M. Rao. The Steiner tree problem II: Properties and classes of facets. Mathematical Programming, 64(2):231–246, 1994.

    Google Scholar 

  14. G. Dahl, A. Martin, and M. Stoer. Routing through virtual paths in layered telecommunication networks. Operations Research, 47(5):693–702, 1999.

    Google Scholar 

  15. M. Dawande, R. Gupta, S. Naranpanawe, and C. Sriskandarajah. A traffic-grooming algorithm for wavelength-routed optical networks. INFORMS Journal on Computing, 2006. To appear.

    Google Scholar 

  16. M. Grötschel, C. Monma, and M. Stoer. Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM Journal on Optimization, 2(3):474–504, August 1992.

    Google Scholar 

  17. M. Grötschel, C.Monma, and M. Stoer. Design of survivable networks. volume Networks of Handbooks in Operations Research and Management Science, chapter 10, pages 617– 672. North-Holland, Amsterdam, 1993.

    Google Scholar 

  18. O. Günlük. A branch-and-cut algorithm for capacitated network design problems. Mathematical Programming, 86:17–39, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  19. H. Höller and S. Voss. A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks. European Journal of Operational Research, 171(3):787–796, June 2006.

    Google Scholar 

  20. ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. CPLEX 10.1 Reference Manual, 2006.

    Google Scholar 

  21. T. Koch and A. Martin. Solving steiner tree problems in graphs to optimality. Networks, 32(3):207–232, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  22. A. M. C. A. Koster, S. Orlowski, C. Raack, G. Baier, and T. Engel. Single-layer cuts for multi-layer network design problems. ZIB Report ZR-07-21, Konrad-Zuse-Zentrum für Informationstechnik Berlin, August 2007.

    Google Scholar 

  23. A. M. C. A. Koster and A. Zymolka. Minimum converter wavelength assignment in all-optical networks. In Proceedings of ONDM 2004, pages 517–535, Ghent, Belgium, 2004. The 8th IFIPWorking Conference on Optical Network Design & Modelling.

    Google Scholar 

  24. A. M. C. A. Koster and A. Zymolka. Tight LP-based lower bounds for wavelength conversion in optical networks. Statistica Neerlandica, 61(1):115–136, 2007.

    Article  MATH  MathSciNet  Google Scholar 

  25. E. Kubilinskas and M. Piòro. An IP/MPLS over WDM network design problem. In Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, volume 3, pages 718–725, March 2005.

    Google Scholar 

  26. T. L. Magnanti and P. Mirchandani. Shortest paths, single origin-destination network design and associated polyhedra. Networks, 33:103–121, 1993.

    Article  MathSciNet  Google Scholar 

  27. T. L. Magnanti, P. Mirchandani, and R. Vachani. Modelling and solving the two-facility capacitated network loading problem. Operations Research, 43:142–157, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  28. H. Marchand and L. A. Wolsey. Aggregation and mixed integer rounding to solve MIPs. Operations Research, 49(3):363–371, 2001.

    Article  MathSciNet  MATH  Google Scholar 

  29. G. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, 1988.

    Google Scholar 

  30. S. Orlowski, A.M. C. A. Koster, C. Raack, and R.Wessäly. Two-layer network design by branch-and-cut featuring MIP-based heuristics. In Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium, April 2007.

    Google Scholar 

  31. S. Orlowski, M. Piòro, A. Tomaszewski, and R. Wessäly. SNDlib 1.0–Survivable Network Design Library. In Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium, April 2007. http://sndlib.zib.de.

    Google Scholar 

  32. F. Ortega and L. A. Wolsey. A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks, 41:143–158, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  33. C. Raack, A. M. C. A. Koster, S. Orlowski, and R. Wessäly. Capacitated network design using general flow-cutset inequalities. ZIB Report 07-14, Konrad-Zuse-Zentrum für Informationstechnik Berlin, June 2007. Submitted to Networks.

    Google Scholar 

  34. C. Raack, A. M. C. A. Koster, and R. Wessäly. On the strength of cut-based inequalities for capacitated network design polyhedra. ZIB-Report 07-08, Konrad-Zuse-Zentrum für Informationstechnik Berlin, June 2007.

    Google Scholar 

  35. S. Raghavan and D. Stanojević. WDM optical design using branch-and-price. Robert H. Smith School of Business, University of Maryland, April 2007.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Warwick, Centre for Discrete Mathematics and its Applications (DIMAP), Coventry, CV4 7AL, United Kingdom

    Arie M.C.A. Koster

  2. Zuse Institute Berlin (ZIB), Takustr. 7, D-14195, Berlin

    Sebastian Orlowski & Christian Raack

  3. Siemens AG CT, Discrete Optimization, Munich, Germany

    Georg Baier

  4. Nokia Siemens Networks GmbH & Co. KG, Munich, Germany

    Thomas Engel

Authors
  1. Arie M.C.A. Koster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sebastian Orlowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Raack
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Georg Baier
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Thomas Engel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Maryland, College Park, MD, USA

    S. Raghavan  & Bruce Golden  & 

  2. American University, Washington, DC, USA

    Edward Wasil

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Koster, A.M., Orlowski, S., Raack, C., Baier, G., Engel, T. (2008). Single-Layer Cuts for Multi-Layer Network Design Problems. In: Raghavan, S., Golden, B., Wasil, E. (eds) Telecommunications Modeling, Policy, and Technology. Operations Research/Computer Science Interfaces, vol 44. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77780-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-77780-1_1

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-77779-5

  • Online ISBN: 978-0-387-77780-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation