Skip to main content
SpringerLink
Log in

Polyhedral Approaches to the Design of Survivable Networks

  • Chapter
Book cover Handbook of Optimization in Telecommunications

Abstract

Long-term planning of backbone telephone networks has been an important area of application of combinatorial optimization over the last few years. In this chapter, we review polyhedral results for models related to these problems. In particular, we study classical survivability requirements in terms of k-connectivity of the network, then we extend the survivability model to include the notion of bounded rings that limit the length of the rerouting path in case of link failure.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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.

Bibliography

  • M. Baïou, F. Barahona, and A.R Mahjoub. Separation of partition inequalities. Mathematics of Operations Research, 25:243–254, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  • A. Balakrishnan and K. Altinkemer. Using a hop-constrained model to generate alternative communication network design. ORSA Journal on Computing, 4(2): 192–205, 1992.

    MATH  Google Scholar 

  • A. Balakrishnan, T.L. Magnanti, A. Shulman, and R.T. Wong. Models for planning capacity expansion in local access telecommunication networks. Annals of Operations Research, 33:239–284, 1991.

    Article  MATH  Google Scholar 

  • R.E. Bellman. On a routing problem. Q. Appl. Math., 16:87–90, 1958.

    MATH  Google Scholar 

  • S.C. Boyd and T. Hao. An integer polytope related to the design of survivable communication networks. SIAM J. Discrete Math., 6(4):612–630, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  • S.C. Boyd and F. Zhang. Transforming clique tree inequalities to induce facets for the 2-edge connected polytope. Technical Report TR-94-13, Department of Computer Science, University of Ottawa, 1994.

    Google Scholar 

  • G.-R. Cai and Y.-G. Sun. The minimum augmentation of any graph to a k-edge-connected graph. Networks, 19:151–172, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  • S. Chopra. The k-edge-connected spanning subgraph polyhedron. SIAM J. Discrete Math., 7(2):245–259, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  • W. Chou and H. Frank. Survivable communication networks and the terminal capacity matrix. IEEE Transactions on Circuit Theory, CT-17:192–197, 1970.

    Article  MathSciNet  Google Scholar 

  • N. Christofides and C.A. Whitlock. Network synthesis with connectivity constraints — a survey. In J.P. Brans, editor, Operational Research’ 81, pages 705–723. North-Holland Publishing Company, 1981.

    Google Scholar 

  • G. Cornuéjols, F. Fonlupt, and D. Naddef. The traveling salesman problem on a graph and some related integer polyhedra. Mathematical Programming, 33:1–27, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  • C.R. Coullard, A. Rais, R.R. Rardin, and D.K. Wagner. The 2-connected-Steiner-subgraph polytope for series-parallel graphs. Technical Report CC-91-32, Purdue University, 1991.

    Google Scholar 

  • C.R. Coullard, A. Rais, R.R. Rardin, and D.K. Wagner. The dominant of the 2-connected-Steiner-subgraph polytope for W 4-free graphs. Discrete Applied Mathematics, 66:195–205, 1996.

    Article  MathSciNet  Google Scholar 

  • C.R. Coullard, A. Rais, D.K. Wagner, and R.L. Rardin. Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs. Networks, 23, 1993.

    Google Scholar 

  • G. Dahl. Notes on polyhedra associated with hop-constrained paths. Operations Research Letters, 25:97–101, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  • G. Dahl and L Gouveia. On the directed hop-constrained shortest path problem. Operations Research Letters, 32:15–22, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  • G. Dahl and B. Johannessen. The 2-path network problem. Networks, 43:190–199, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  • G. Dahl, Foldnes N., and L Gouveia. A note on hop-constrained walk polytopes. Operations Research Letters, 32:345–349, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  • A. De Jongh. Uncapacitated network design with bifurcated routing. PhD thesis, Université Libre de Bruxelles, 1998.

    Google Scholar 

  • M. Didi Biha and A.R. Mahjoub. k-edge connected polyhedra on series-parallel graphs. Operations Research Letters, 19:71–78, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  • E.W. Dijkstra. A note on two problems in connection with graphs. Numer. Math., 1: 269–271, 1959.

    Article  MATH  MathSciNet  Google Scholar 

  • K.P. Eswaran and R.E. Tarjan. Augmentation problems. SIAM Journal on Computing, 5:653–665, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  • B. Fortz. Design of Survivable Networks with Bounded Rings, volume 2 of Network Theory and Applications. Kluwer Academic Publishers, 2000.

    Google Scholar 

  • B. Fortz and M. Labbé. Polyhedral results for two-connected networks with bounded rings. Mathematical Programming, 93(1):27–54, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  • B. Fortz and M. Labbé. Two-connected networks with rings of bounded cardinality. Computational Optimization and Applications, 27(2): 123–148, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  • B. Fortz, M. Labbé, and F. Maffioli. Solving the two-connected network with bounded meshes problem. Operations Research, 48(6):866–877, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  • B. Fortz, A.R. Mahjoub, S.T. Mc Cormick, and P. Pesneau. Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut. IAG Working Paper 98/03, Université Catholique de Louvain, 2003a. To appear in Mathematical Programming.

    Google Scholar 

  • B. Fortz, P. Soriano, and C. Wynants. A tabu search algorithm for self-healing ring network design. European Journal of Operational Research, 151(2):280–295, 2003b.

    Article  MATH  MathSciNet  Google Scholar 

  • A. Frank. Augmenting graphs to meet edge-connectivity requirements. SIAM J. on Discrete Mathematics, 5(1):22–53, 1992.

    Google Scholar 

  • H. Frank and W. Chou. Connectivity considerations in the design of survivable networks. IEEE Transactions on Circuit Theory, CT-17:486–490, 1970.

    Article  MathSciNet  Google Scholar 

  • D.R. Fulkerson and L.S. Shapley. Minimal k-arc connected graphs. Networks, 1: 91–98, 1971.

    Article  MATH  MathSciNet  Google Scholar 

  • M.X. Goemans. Arborescence polytopes for series-parallel graphs. Discrete Applied Mathematics, 51:277–289, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  • R.E. Gomory and T.C. Hu. Multi-terminal network flows. SIAM J. Appl. Math., 9: 551–570, 1961.

    Article  MATH  MathSciNet  Google Scholar 

  • L. Gouveia. Multicommodity flow models for spanning trees with hop constraints. European Journal of Operational Research, 95:178–190, 1996.

    Article  MATH  Google Scholar 

  • L. Gouveia and T.L. Magnanti. Network flow models for designing diameter-constrained minimum-spanning and steiner trees. Networks, 41(3): 159–173, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  • M. Grötschel and C.L. Monma. Integer polyhedra arising from certain design problems with connectivity constraints. SIAM J. Discrete Math., 3:502–523, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  • M. Grötschel, C.L. Monma, and M. Stoer. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operations Research, 40(2):309–330, 1992a.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  • M. Grötschel, C.L. Monma, and M. Stoer. Design of Survivable Networks, volume 7 on Network models of Handbooks in OR/MS, chapter 10, pages 617–672. North-Holland, 1995a.

    Google Scholar 

  • M. Grötschel, C.L. Monma, and M. Stoer. Polyhedral and computational investigations for designing communication networks with high survivability requirements. Operations Research, 43(6): 1012–1024, 1995b.

    Article  MATH  MathSciNet  Google Scholar 

  • F. Harary. The maximum connectivity of a graph. In Proceedings of the National Academy of Sciences, volume 48, pages 1142–1146, USA, 1962.

    Article  MATH  Google Scholar 

  • T.-S. Hsu and V. Ramachandran. A linear time algorithm for triconnectivity augmentation. In Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, pages 548–559, 1991.

    Google Scholar 

  • T.-S. Hsu and V. Ramachandran. On finding a minimum augmentation to biconnect a graph. SIAM Journal on Computing, 22:889–891, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  • D. Huygens, A.R. Mahjoub, and P. Pesneau. Two edge-disjoint hop-constrained paths and polyhedra. SIAM Journal on Discrete Mathematics, 18(2):287–312, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  • H. Kerivin and A.R. Mahjoub. Separation of the partition inequalities for the (1,2)-survivable network design problem. Operations Research Letters, 30:265–268, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  • J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7:48–50, 1956.

    Article  MathSciNet  Google Scholar 

  • E.L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Wilson, New-York, 1976.

    MATH  Google Scholar 

  • E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons, New-York, 1985.

    MATH  Google Scholar 

  • A.R. Mahjoub. Two-edge connected spanning subgraphs and polyhedra. Mathematical Programming, 64:199–208, 1994.

    Article  MathSciNet  Google Scholar 

  • K. Menger. Zur allgemeinen kurventheorie. Fundamenta Mathematicae, 10:96–115, 1927.

    MATH  Google Scholar 

  • C.L. Monma and D.F. Shallcross. Methods for designing communications networks with certain two-connected survivability constraints. Operations Research, 37(4): 531–541, 1989.

    Article  Google Scholar 

  • D. Naor, D. Gusfield, and Ch. Martel. A fast algorithm for optimally increasing the edge-connectivity. In Proceedings of the Foundation of Computer Science’ 90, pages 698–707, St. Louis, 1990.

    Google Scholar 

  • G.L. Nemhauser and L.A. Wolsey. Integer and combinatorial optimization. Wiley-Interscience series in discrete mathematics and optimization. Wiley, 1988.

    Google Scholar 

  • V.-H Nguyen. A complete description for the k-path polyhedron. Technical report, LIP6, 2003.

    Google Scholar 

  • R.C. Prim. Shortest connection networks and some generalizations. Bell System Tech. J., 36:1389–1401, 1957.

    Google Scholar 

  • A. Rosenthal and A. Goldner. Smallest augmentation to biconnect a graph. SIAM Journal on Computing, 6:55–66, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  • M. Stoer. Design of Survivable Networks, volume 1531 of Lecture Notes in Mathematics. Springer-Verlag, 1992.

    Google Scholar 

  • J.W. Suurballe. Disjoint paths in a network. Networks, 4:125–145, 1974.

    Article  MATH  MathSciNet  Google Scholar 

  • J.W. Suurballe and R.E. Tarjan. A quick method for finding shortest pairs of disjoint paths. Networks, 14:325–336, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  • S. Ueno, Y. Kajitani, and H. Wada. Minimum augmentation of a tree to a k-edge-connected graph. Networks, 18:19–25, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  • J.A. Wald and C.J. Colbourn. Steiner trees, partial 2-trees, and minimum ifi networks. Networks, 13:159–167, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  • T. Watanabe and A. Nakamura. Edge-connectivity augmentation problems. Computer and System Sciences, 35:96–144, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  • P. Winter. Generalized Steiner problem in halin networks. In Proc. 12th International Symposium on Mathematical Programming. MIT, 1985a.

    Google Scholar 

  • P. Winter. Generalized Steiner problem in outerplanar networks. BIT, 25:485–496, 1985b.

    Article  MATH  MathSciNet  Google Scholar 

  • P. Winter. Generalized Steiner problem in series-parallel networks. Journal of Algorithms, 7:549–566, 1986a.

    Article  MATH  MathSciNet  Google Scholar 

  • P. Winter. Topological network synthesis. In B. Simeone, editor, Combinatorial Optimization-Como 1986, volume 1403 of Lecture Notes in Mathematics, pages 282–303. Springer-Verlag, 1986b.

    Google Scholar 

  • P. Winter. Steiner problems in networks: a survey. Networks, 17:129–167, 1987.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut d’Administration et de Gestion, Université Catholique de Louvain, B-1348, Louvain-la-Neuve, Belgium

    Bernard Fortz

  2. Département d’lnformatique, Université Libre de Bruxelles, 1050, Bruxelles, Belgium

    Martine Labbé

Authors
  1. Bernard Fortz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martine Labbé
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Labs Research, Florham Park, New Jersey

    Mauricio G. C. Resende

  2. University of Florida, Gainesville, Florida

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Fortz, B., Labbé, M. (2006). Polyhedral Approaches to the Design of Survivable Networks. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_15

Download citation

Publish with us

Policies and ethics

Search

Navigation