SONET/SDH ring assignment with capacity constraints

DOI10.1016/S0166-218X(02)00236-6zbMath1023.68003MaRDI QIDQ1399114

Alexandre Laugier, Olivier Goldschmidt, Eli V. Olinick

Publication date: 30 July 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

heuristicsinteger programmingapproximation algorithmstelecommunications networksequipment placement in SONET rings

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (16)

Circular and radial design comparison of survivability in asymmetrical hierarchical networks ⋮ Stochastic graph partitioning: quadratic versus SOCP formulations ⋮ Optimization in telecommunication networks ⋮ A branch‐and‐cut algorithm for the ring spur assignment problem ⋮ Valid inequalities and facets for multi‐module survivable network design problem ⋮ A tabu search algorithm for self-healing ring network design. ⋮ Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. ⋮ Grooming for two-period optical networks ⋮ Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles ⋮ Improved compact formulations for a wide class of graph partitioning problems in sparse graphs ⋮ A decomposition algorithm for the ring spur assignment problem ⋮ A ring-mesh topology design problem for optical transport networks ⋮ Continuous relaxations for the traveling salesman problem ⋮ Approximation algorithms for the design of SDH/SONET networks ⋮ A directed cycle-based column-and-cut generation method for capacitated survivable network design ⋮ Comparing metaheuristic algorithms for SONET network design problems

Uses Software

• SONET

Cites Work

• Exact solution of the SONET ring loading problem
• Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
• Optimal Load Balancing on Sonet Bidirectional Rings
• The Ring Loading Problem
• A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
• Clustering for the Design of SONET Rings in Interoffice Telecommunications
• The symmetric generalized traveling salesman polytope
• Unnamed Item

This page was built for publication: SONET/SDH ring assignment with capacity constraints