Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-28T01:46:17.111Z Has data issue: false hasContentIssue false
  • English
  • Français

Approximation algorithms for the designof SDH/SONET networks

Published online by Cambridge University Press:  15 March 2004

Nadia Brauner ,
Yves Crama ,
Gerd Finke ,
Pierre Lemaire  and
Christelle Wynants
Nadia Brauner
Affiliation:
Laboratoire Leibniz-IMAG, 46 avenue Félix Viallet, 38031 Grenoble Cedex, France; [email protected]., [email protected]., [email protected].
Yves Crama
Affiliation:
École d'Administration des Affaires, Université de Liège, boulevard du Rectorat 7 (B31), 4000 Liège, Belgique; [email protected].
Gerd Finke
Affiliation:
Laboratoire Leibniz-IMAG, 46 avenue Félix Viallet, 38031 Grenoble Cedex, France; [email protected]., [email protected]., [email protected].
Pierre Lemaire
Affiliation:
Laboratoire Leibniz-IMAG, 46 avenue Félix Viallet, 38031 Grenoble Cedex, France; [email protected]., [email protected]., [email protected].
Christelle Wynants
Affiliation:
Electrabel Quantitive Analysis, 8 boulevard du Régent, 1000 Brussels, Belgique; [email protected].
Get access

Abstract

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

Keywords

Graph partitioningapproximationsheuristicstabuSONET/SDH networks.
Type
Research Article
Information
RAIRO - Operations Research , Volume 37 , Issue 4: ROADEF 2002 , October 2003 , pp. 235 - 247
Copyright
© EDP Sciences, 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

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).
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/
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/
Chvátal, V., Greedy Heuristic, A for the Set-Covering Problem. Math. Oper. Res. 4 (1979) 233-235 . CrossRef
ETSI. ETSI - Telecom Standards. http://www.etsi.org
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.
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.
B. Fortz, P. Soriano and C. Wynants, A Tabu Search Algorithm for Self-Healing Ring Network Design. Eur. J. Oper. Res. 151 (2003).
M.R. Garey and D.S. Johnson, Computers and Intractability (A Guide to the Theory of NP-Completeness). W.H. Freeman And Company (1979).
F. Glover and M. Laguna, Modern Heuristic Techniques for Combinatorial Problems, Chapter 3: Tabu Search. C.R. Reeves, Blackwell Scientific Publications edition (1993).
F. Glover and M. Laguna, Tabu Search. Kluwer Academic Publishers, London (1997).
Goldschmidt, O., Hochbaum, D.S., Levin, A. and Olinick, E.V., Edge-Partition Problem, The SONET. Networks 41 (2003) 13-23 . CrossRef
Goldschmidt, O., Laugier, A. and Olinick, E.V., SONET/SDH Ring Assignment with Capacity Constraints. Discrete Appl. Math. 129 (2003) 99-128 . CrossRef
Holyer, I., The NP-completeness of some edge-partition problems. SIAM J. Comput. 4 (1981) 713-717. CrossRef
Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R. and Graham, R.L., Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3 (1974) 299-325 . CrossRef
S. Khanna, A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem. Bell Labs Technical Journal (1997) 36-41.
Laguna, M., Clustering for the Design of SONET Rings in Interoffice Telecommunications. Manage. Sci. 40 (1994) 1533-1541. CrossRef
Lee, Y., Sherali, H.D., Han, J. and Kim, S., A branch-and-cut algorithm for solving an intraring synchronous optical network design problem. Networks 35 (2000) 223-232 . 3.0.CO;2-J>CrossRefPubMed
P. Lemaire, Optimisation de réseaux SONET/SDH : éléments théoriques et résolution pratique (juin 2001). Mémoire de DEA.
Masuyama, S. and Ibaraki, T., Chain Packing in Graphs. Algorithmica 6 (1991) 826-839 . CrossRef
D. Mili, Self-Healing Ring Architectures for SONET Network Applications. http://www.doc.ic.ac.uk/~nd/surprise_96/journal/vol2/dm9/article2.html
Schrijver, A., Seymour, P. and Winkler, P., The Ring Loading Problem. SIAM J. Discrete Math. 11 (1998) 1-14 . CrossRef
Sutter, A., Vanderbeck, F. and Wolsey, L.A., Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms. Oper. Res. 46 (1998) 719-728. CrossRef
T.-H. Wu, Fiber Network Service Survivability. Artech House, Inc. (1992).
The SONET Home Page. http://www.sonet.com