Approximation algorithms for the design of SDH/SONET networks

RAIRO Recherche Operationnelle

Volumn 37, Issue 4, 2003, Pages 235-247

  Brauner, Nadia ^a   Crama, Yves ^b   Finke, Gerd ^a   Lemaire, Pierre ^a   Wynants, Christelle ^c  

^a Laboratoire Leibniz   (France)

^b UNIVERSITY OF LIÈGE   (Belgium)

^c ELECTRABEL   (Belgium)

Author keywords

Approximations; Graph partitioning; Heuristics; SONET SDH networks; Tabu

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; MULTIPLEXING; OPERATIONS RESEARCH; STANDARDS; TELECOMMUNICATION SYSTEMS;

APPROXIMATIONS; GRAPH PARTITIONING; HEURISTICS; SONET/SDH NETWORKS; TABU;

ALGORITHMS;

EID: 1942541410     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro:2004003     Document Type: Conference Paper

References (25)

1. R. Aringhieri and M. Dell'Amico, A Variable-Neighborhood Variable-Objective Tabu Search Algorithm for the SONET Ring Assignment with Capacity Constraints. DISMI, Università di Modena e Reggio Emilia, 10 (2001).
2. N. Brauner, Y. Crama, P. Lemaire and C. Wynants, Complexité et approximation pour la conception de réseaux SONET/SDH. Technical Report 61, Les Cahiers du Laboratoire Leibniz-IMAG, (October 2002). http://ww-leibniz.imag.fr/LesCahiers/
3. N. Brauner and P. Lemaire, A Set-Covering Approach for SONET Network Design. Technical Report 62, Les Cahiers du Laboratoire Leibniz-IMAG (October 2002). http://www-leibniz.imag.fr/LesCahiers/
4. V. Chvátal, A Greedy Heuristic for the Set-Covering Problem. Math. Oper. Res. 4 (1979) 233-235.
5. ETSI. ETSI - Telecom Standards, http://www.etsi.org
6. ETSI. Transmission and Multiplexing (TM); Synchronous Digital Hierarchy (SDH); Network protection schemes; Rings and other schemes. Technical specification (November 1997). ref: TS 101 010 v1.1.1.
7. ETSI. Transmission and Multiplexing (TM); Synchronous Digital Hierarchy (SDH); Network protection schemes; Types and characteristics. Technical specification (November 1997). ref: TS 101 009 v1.1.1.
8. B. Fortz, P. Soriano and C. Wynants, A Tabu Search Algorithm for Self-Healing Ring Network Design. Eur. J. Oper. Res. 151 (2003).
9. M.R. Garey and D.S. Johnson, Computers and Intractability (A Guide to the Theory of NP-Completeness). W.H. Freeman And Company (1979).
10. F. Glover and M. Laguna, Modern Heuristic Techniques for Combinatorial Problems, Chapter 3: Tabu Search. C.R. Reeves, Blackwell Scientific Publications edition (1993).
11. F. Glover and M. Laguna, Tabu Search. Kluwer Academic Publishers, London (1997).
12. O. Goldschmidt, D.S. Hochbaum, A. Levin and E.V. Olinick, The SONET Edge-Partition Problem. Networks 41 (2003) 13-23.
13. O. Goldschmidt, A. Laugier and E.V. Olinick, SONET/SDH Ring Assignment with Capacity Constraints. Discrete Appl. Math. 129 (2003) 99-128.
14. I. Holyer, The NP-completeness of some edge-partition problems. SIAM J. Comput. 4 (1981) 713-717.
15. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey and R.L. Graham, Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3 (1974) 299-325.
16. S. Khanna, A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem. Bell Labs Technical Journal (1997) 36-41.
17. M. Laguna, Clustering for the Design of SONET Rings in Interoffice Telecommunications. Manage. Sci. 40 (1994) 1533-1541.
18. Y. Lee, H.D. Sherali, J. Han and S. Kim, A branch-and-cut algorithm for solving an intraring synchronous optical network design problem. Networks 35 (2000) 223-232.
19. P. Lemaire, Optimisation de réseaux SONET/SDH: éléments théoriques et résolution pratique (juin 2001). Mémoire de DEA.
20. S. Masuyama and T. Ibaraki, Chain Packing in Graphs. Algorithmica 6 (1991) 826-839.
21. D. Mili, Self-Healing Ring Architectures for SONET Network Applications, http://www.doc.ic.ac.uk/~nd/surprise_96/journal/vo12/dm9/article2. html
22. A. Schrijver, P. Seymour and P. Winkler, The Ring Loading Problem. SIAM J. Discrete Math. 11 (1998) 1-14.
23. 23] A. Sutter, F. Vanderbeck and L.A. Wolsey, Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms. Oper. Res. 46 (1998) 719-728.
24. T.-H. Wu, Fiber Network Service Survivability. Artech House, Inc. (1992).
25. The SONET Home Page. http://www.sonet.com