Approximation algorithms for the design of SDH/SONET networks

DOI10.1051/RO:2004003MaRDI QIDQ5479829zbMATH OpenOpenAlexFDO

Authors Nadia Brauner, Gerd Finke, Pierre Lemaire, Christelle Wynants, Yves Crama

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, https://eudml.org/doc/105293

zbMATH Keywords

approximationsgraph partitioningheuristicsSONET/SDH networkstabu

Mathematics Subject Classification ID

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

Recommendations

• The SONET edge‐partition problem
• scientific article; zbMATH DE number 1003253
• Comparing metaheuristic algorithms for SONET network design problems
• SONET/SDH ring assignment with capacity constraints
• Optimal cost stacked uni-directional path switched SONET/SDH ring design

Cites work

• A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
• A Greedy Heuristic for the Set-Covering Problem
• A tabu search algorithm for self-healing ring network design.
• Chain packing in graphs
• Clustering for the Design of SONET Rings in Interoffice Telecommunications
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
• SONET/SDH ring assignment with capacity constraints
• The NP-Completeness of Some Edge-Partition Problems
• The Ring Loading Problem
• The SONET edge‐partition problem
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(8)

• A traffic partition algorithm for switched LANs and its performance analysis
• Comparing metaheuristic algorithms for SONET network design problems
• On the complexity and algorithm of grooming regular traffic in WDM optical networks
• The SONET edge‐partition problem
• Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths
• Arc perturbation algorithms for optical network design
• Approximation algorithms for grooming in optical network design
• Better approximating SONET k-edge partition for small capacity k

Describes a project that uses

Uses Software

• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479829)