Survivability in Hierarchical Telecommunications Networks Under Dual Homing

References

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