Skip to main content
SpringerLink
Log in

The design of survivable directed networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

We study a survivable network design problem:the directed network design problem with connectivity constraints (DNCC). Some applications in telecommunications are presented. We discuss two integer linear programming models for DNCC, and relate these. The main body of the paper is a study of DNCC from a polyhedral point of view. We give several classes of nonredundant inequalities for polytopes associated with the problem. A cutting plane algorithm based on the polyhedral results is described and some computational results are given.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Balas and W.R. Pulleyblank, The perfectly matchable subgraph polytope of a bipartite graph, Networks 13(1983)495–516.

    Google Scholar 

  2. Bellcore,Fiber Options: Software for designing survivable fiber optic communications networks, Software Package (1988).

  3. S. Chopra, Polyhedra of the equivalent subgraph problem and some edge connectivity problems, Preprint, Northwestern University, Evanston (1988).

    Google Scholar 

  4. S. Chopra and M.R. Rao, The Steiner tree problem I: Formulations, compositions and extensions of facets, Research Report, Graduate School of Business Administration, New York University (1988).

  5. G. Dahl, Directed Steiner problems with connectivity constraints (1990), Discr. Appl. Math. 47(1993)109–128.

    Article  Google Scholar 

  6. G. Dahl, Contributions to the design of directed survivable networks, Ph.D. Thesis, University of Oslo (1991), ISBN 82-423-0194-8, available from Norwegian Telecom Research.

  7. G. Dantzig, Applications of the simplex method to a transportation problems, in:Activity Analysis of Production and Allocation, ed. T.C. Koopmans (Wiley, New York, 1951).

    Google Scholar 

  8. K.P. Eswaran and R.E. Tarjan, Augmentation problems, SIAM J. Comp. 5(1976)653–665.

    Article  Google Scholar 

  9. M. Grötschel, L. Lovasz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, 1988).

  10. M. Grötschel and C.L. Monma, Integer polyhedra arising from certain network design problems with connectivity constraints, SIAM J. Discr. Math. 3(1990)502–523.

    Article  Google Scholar 

  11. M. Grötschel, C.L. Monma and M. Stoer, Facets for polyhedra arising in the design of communication networks with low-connectivity constraints, Report No. 187, UniversitÄt Augsburg (1989).

  12. M. Grötschel, C.L. Monma and M. Stoer, Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints, Report No. 188, UniversitÄt Augsburg (1989).

  13. M. Grötschel, C.L. Monma and M. Stoer, Polyhedral approaches to network survivability, Report No. 189, UniversitÄt Augsburg (1989).

  14. W.G. Liu, Extended formulation and polyhedral projection, Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo (1988).

  15. C.L. Monma, B. Munson and W.R. Pulleyblank, Minimum weight two-connected spanning networks, Math. Progr. 46(1990)153–171.

    Article  Google Scholar 

  16. C.L. Monma and D.F. Shallcross, Methods for designing communication networks with certain two-connected survivability constraints, Oper. Res. 37(1989)531–541.

    Google Scholar 

  17. W.R. Pulleyblank, Polyhedral combinatorics, in:Handbooks in Operations Research and Management Science, Vol. 1, Optimization, eds. G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (North-Holland, Amsterdam, 1989).

    Google Scholar 

  18. A. Sassano, On the facial structure of the set covering polytope, Math. Progr. 44(1989)181–203.

    Article  Google Scholar 

  19. A. Schrijver,Theory of Integer and Linear Programming (Wiley, 1986).

  20. T. Soneoka, H. Nakada and M. Imase, Design of ad-connected digraph with a minimum number of edges and a quasiminimal diameter, Discr. Appl. Math. 27(1990)255–265.

    Article  Google Scholar 

  21. K. Steiglitz, P. Wiener and D.J. Kleitman, The design of minimum-cost survivable networks, IEEE Trans. Circuit Theory 16(1969)455–460.

    Google Scholar 

  22. M. Stoer, Design of survivable networks, Ph.D. Thesis, University of Augsburg (1991).

  23. J.W. Suurballe, Disjoint paths in networks, Networks 14(1974)125–145.

    Google Scholar 

  24. P. Winter, Generalized Steiner problems in series-parallel networks, BIT 25(1985)485–496.

    Article  Google Scholar 

  25. P. Winter, Generalized Steiner problems in outerplanar networks, J. Algorithms 7(1986)549–566.

    Article  Google Scholar 

  26. R.T. Wong, A dual ascent algorithm for Steiner tree problems on a directed graph, Math. Progr. 28(1984)271–287.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Norwegian Telecom Research, P.O. Box 83, N-2007, Kjeller, Norway

    Geir Dahl

Authors
  1. Geir Dahl
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dahl, G. The design of survivable directed networks. Telecommunication Systems 2, 349–377 (1993). https://doi.org/10.1007/BF02109865

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02109865

Keywords

Search

Navigation