Traffic partition in WDM/SONET rings to minimize SONET ADMs

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

Recommendations

Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
Approximation and Online Algorithms
Better bounds for minimizing SONET ADMs
Minimization of SONET ADMs in ring networks revisited
Approximation and Online Algorithms

Cited in

(23)

Better bounds for minimizing SONET ADMs
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
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 equilibria for ADM minimization games
On the complexity of approximation and online scheduling problems with applications to optical networks
scientific article; zbMATH DE number 6501125 (Why is no real title available?)
On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings
Approximating the traffic grooming problem in tree and star networks
AN EFFICIENT HEURISTIC FOR TRAFFIC GROOMING AND LIGHT-PATH ROUTING IN WDM RING NETWORKS WITH HOP-COUNT CONSTRAINT
Assignment of add–drop multiplexer (ADM) rings and digital cross-connect system (DCS) mesh in telecommunication networks
scientific article; zbMATH DE number 1898334 (Why is no real title available?)
Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths
On the complexity of the regenerator cost problem in general networks with traffic grooming
Structural Information and Communication Complexity
Approximation and Online Algorithms
Optimizing regenerator cost in traffic grooming
Better approximating SONET k-edge partition for small capacity k
The chord version for SONET ADMs minimization
On-line maximum matching in complete multi-partite graphs with an application to optical networks
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

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

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