Traffic partition in WDM/SONET rings to minimize SONET ADMs

zbMath1046.90012MaRDI QIDQ1810863

Peng-Jun Wan, Gruia Călinescu

Publication date: 9 June 2003

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsWDMgroomingadd-drop multiplexerSONET

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (14)

Minimization of SONET ADMs in ring networks revisited ⋮ Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem ⋮ On-line maximum matching in complete multi-partite graphs with an application to optical networks ⋮ On equilibria for ADM minimization games ⋮ Approximating the traffic grooming problem in tree and star networks ⋮ Optimizing regenerator cost in traffic grooming ⋮ On the complexity of the regenerator cost problem in general networks with traffic grooming ⋮ On minimizing the number of ADMs in a general topology optical network ⋮ Optimal on-line colorings for minimizing the number of ADMs in optical networks ⋮ Better bounds for minimizing SONET ADMs ⋮ On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks ⋮ On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology ⋮ Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs ⋮ The chord version for SONET ADMs minimization

This page was built for publication: Traffic partition in WDM/SONET rings to minimize SONET ADMs