Minimization of SONET ADMs in ring networks revisited
From MaRDI portal
(Redirected from Publication:2380804)
Recommendations
Cites work
- Better bounds for minimizing SONET ADMs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On minimizing the number of ADMs in a general topology optical network
- On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- The chord version for SONET ADMs minimization
- Traffic partition in WDM/SONET rings to minimize SONET ADMs
Cited in
(14)- scientific article; zbMATH DE number 6501125 (Why is no real title available?)
- SONET ADMs minimization with divisible paths
- Better bounds for minimizing SONET ADMs
- Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs
- Approximation and Online Algorithms
- Assignment of add–drop multiplexer (ADM) rings and digital cross-connect system (DCS) mesh in telecommunication networks
- 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
- Traffic partition in WDM/SONET rings to minimize SONET ADMs
- Minimizing ADMs on WDM directed fiber trees
- Structural Information and Communication Complexity
- Approximation and Online Algorithms
- The chord version for SONET ADMs minimization
- On equilibria for ADM minimization games
This page was built for publication: Minimization of SONET ADMs in ring networks revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380804)