Approximation algorithms for the design of SDH/SONET networks
RAIRO - Operations Research - Recherche Opérationnelle, Volume 37 (2003) no. 4, p. 235-247

In this paper, a graph partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study.

DOI : https://doi.org/10.1051/ro:2004003
Keywords: graph partitioning, approximations, heuristics, tabu, SONET/SDH networks
@article{RO_2003__37_4_235_0,
     author = {Brauner, Nadia and Crama, Yves and Finke, Gerd and Lemaire, Pierre and Wynants, Christelle},
     title = {Approximation algorithms for the design of SDH/SONET networks},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     publisher = {EDP-Sciences},
     volume = {37},
     number = {4},
     year = {2003},
     pages = {235-247},
     doi = {10.1051/ro:2004003},
     zbl = {1092.90011},
     mrnumber = {2064600},
     language = {en},
     url = {http://www.numdam.org/item/RO_2003__37_4_235_0}
}
Brauner, Nadia; Crama, Yves; Finke, Gerd; Lemaire, Pierre; Wynants, Christelle. Approximation algorithms for the design of SDH/SONET networks. RAIRO - Operations Research - Recherche Opérationnelle, Volume 37 (2003) no. 4, pp. 235-247. doi : 10.1051/ro:2004003. http://www.numdam.org/item/RO_2003__37_4_235_0/

[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://www-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. | MR 539404 | Zbl 0443.90066

[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). | MR 2014077 | Zbl 1053.90020

[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). | MR 519066 | Zbl 0411.68039

[10] F. Glover and M. Laguna, Modern Heuristic Techniques for Combinatorial Problems, Chapter 3: Tabu Search. C.R. Reeves, Blackwell Scientific Publications edition (1993). | MR 1230642

[11] F. Glover and M. Laguna, Tabu Search. Kluwer Academic Publishers, London (1997). | MR 1665424 | Zbl 0930.90083

[12] O. Goldschmidt, D.S. Hochbaum, A. Levin and E.V. Olinick, The SONET Edge-Partition Problem. Networks 41 (2003) 13-23. | MR 1946893 | Zbl 1026.90076

[13] O. Goldschmidt, A. Laugier and E.V. Olinick, SONET/SDH Ring Assignment with Capacity Constraints. Discrete Appl. Math. 129 (2003) 99-128. | MR 1989013 | Zbl 1023.68003

[14] I. Holyer, The NP-completeness of some edge-partition problems. SIAM J. Comput. 4 (1981) 713-717. | MR 635429 | Zbl 0468.68069

[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. | MR 434396 | Zbl 0297.68028

[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. | Zbl 0823.90040

[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. | MR 1764882 | Zbl 0985.90093

[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. | MR 1134432 | Zbl 0731.68088

[21] D. Mili, Self-Healing Ring Architectures for SONET Network Applications

[22] A. Schrijver, P. Seymour and P. Winkler, The Ring Loading Problem. SIAM J. Discrete Math. 11 (1998) 1-14. | Zbl 0910.90135

[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. | Zbl 0987.90014

[24] T.-H. Wu, Fiber Network Service Survivability. Artech House, Inc. (1992).

[25] The SONET Home Page. http://www.sonet.com