Survivability in hierarchical telecommunications networks under dual homing

INFORMS Journal on Computing

Volumn 26, Issue 1, 2014, Pages 1-15

  Karaşan, Oya Ekin ^a   Mahjoub, A Ridha ^b   Özkök, Onur ^a   Yaman, Hande ^a  

^a BILKENT UNIVERSITY   (Turkey)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Branch and cut; Dual homing survivability; Facets; Hierarchical network design; Two edge connectedness; Variable fixing

Indexed keywords

BRANCH AND CUT; DUAL-HOMING SURVIVABILITY; FACETS; HIERARCHICAL NETWORK; TWO-EDGE CONNECTEDNESS; VARIABLE FIXING;

COMBINATORIAL OPTIMIZATION; DESIGN; LINEAR PROGRAMMING;

TELECOMMUNICATION;

EID: 84893858500     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1120.0541     Document Type: Article

References (27)

1. Balakrishnan A, Magnanti TL, Mirchandani P (1998) Designing hierarchical survivable networks. Oper. Res. 46(1):116-136.
2. Balakrishnan A, Mirchandani P, Natarajan HP (2009) Connectivity upgrade models for survivable network design. Oper. Res. 57(1):170-186.
3. Baldacci R, Dell'Amico M, Gonzalez JS (2007) The capacitated m-ring-star problem. Oper. Res. 55(6):1142-1162.
4. Din DR, Tseng SS (2002) A genetic algorithm for solving dualhoming cell assignment problem of the two-level wireless ATM network. Comput. Comm. 25(17):1536-1547.
5. Fouilhoux P, Karasan OE, Mahjoub AR, Ozkok O, Yaman H (2012) Survivability in hierarchical telecommunications networks. Networks 59(1):37-58.
6. Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York).
7. Gourdin E, Labbé M, Yaman H (2002) Telecommunication and location. Drezner Z, Hamacher HW, eds. Facility Location: Applications and Theory (Springer, Berlin), 275-305.
8. Grötschel M, Monma CL, Stoer M (1995) Design of survivable communications networks. Ball MO, Magnanti TL, Monma CL, Nemhauser GL, eds. Network Models (North-Holland, Amsterdam), 617-671.
9. Hao J, Orlin JB (1994) A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms 17(3):424-446.
10. Kerivin H, Mahjoub AR (2005a) Design of survivable networks: A survey. Networks 46(1):1-21.
11. Kerivin H, Mahjoub AR (2005b) On survivable network polyhedra. Discrete Math. 290(2-3):183-210.
12. Klincewicz JG (1998) Hub location in backbone/tributary network design: A review. Location Sci. 6(1-4):307-335.
13. Kraushaar J (1999) Fiber deployment update-end of year 1998. Report, Industrial Analysis Division, Common Carrier Bureau, Federal Communications Commission, Washington, DC.
14. Labbé M, Laporte G, Martin IR, Gonzalez JJS (2004) The ring star problem: Polyhedral analysis and exact algorithm. Networks 43(3):177-189.
15. Lee CY, Koh SJ (1997) A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach. Comp. Oper. Res. 24(9):883-897.
16. Magnanti TL, Raghavan S (2005) Strong formulations for network design problems with connectivity requirements. Networks 45(2):61-79.
17. Mahjoub AR (1994) Two-edge connected spanning subgraphs and polyhedra. Math. Prog. 64(1-3):199-208.
18. Mahjoub AR, Pesneau P (2008) On the Steiner 2-edge connected subgraph polytope. RAIRO Oper. Res. 42(3):259-283.
19. Proestaki A, Sinclair MC (2000) Design and dimensioning of dualhoming hierarchical multi-ring networks. IEEE Proc. Comm. 147(2):96-104.
20. Reinelt G (1991) TSPLIB-A traveling salesman problem library. ORSA J. Comp. 3(4):376-384.
21. Schrijver A (1986) Theory of Linear and Integer Programming (Wiley, Hoboken, NJ).
22. Shi JJ, Fonseka JP (1997) Analysis and design of survivable communications networks. IEE Proc. Comm. 144(5):322-330.
23. Stoer M (1992) Design of Survivable Networks. Lecture Notes in Mathematics, Vol. 1531 (Springer-Verlag, Berlin).
24. Thomadsen T, Stidsen T (2005) Hierarchical ring network design using branch-and-price. Telecomm. Sys. 29:61-76.
25. Vandenbussche D, Nemhauser GL (2005) The 2-edge-connected subgraph polyhedron. J. Combin. Optim. 9(4):357-379.
26. Wolsey LA (1998) Integer Programming (Wiley, Hoboken, NJ).
27. Zhang J, Mukherjee B (2004) A review of fault management in WDM mesh networks: Basic concepts and research challenges. IEEE Network 18(2):41-48.