Approximation algorithms for the design of SDH/SONET networks

DOI10.1051/ro:2004003zbMath1092.90011OpenAlexW2025002731MaRDI QIDQ5479829

Pierre Lemaire, Gerd Finke, Nadia Brauner, Christelle Wynants, Yves Cramer

Publication date: 11 July 2006

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2003__37_4_235_0

zbMATH Keywords

heuristicsapproximationsgraph partitioningtabuSONET/SDH networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

On the complexity and algorithm of grooming regular traffic in WDM optical networks ⋮ Approximation algorithms for grooming in optical network design ⋮ Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Chain packing in graphs
• SONET/SDH ring assignment with capacity constraints
• A tabu search algorithm for self-healing ring network design.
• Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
• A Greedy Heuristic for the Set-Covering Problem
• The NP-Completeness of Some Edge-Partition Problems
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• The Ring Loading Problem
• A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
• The SONET edge‐partition problem
• Clustering for the Design of SONET Rings in Interoffice Telecommunications

This page was built for publication: Approximation algorithms for the design of SDH/SONET networks