Pages that link to "Item:Q1810863"
From MaRDI portal
The following pages link to Traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1810863):
Displaying 19 items.
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- The chord version for SONET ADMs minimization (Q817808) (← links)
- On-line maximum matching in complete multi-partite graphs with an application to optical networks (Q896661) (← links)
- On minimizing the number of ADMs in a general topology optical network (Q967313) (← links)
- Optimal on-line colorings for minimizing the number of ADMs in optical networks (Q972358) (← links)
- Better bounds for minimizing SONET ADMs (Q1004601) (← links)
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1605303) (← links)
- Minimization of SONET ADMs in ring networks revisited (Q2380804) (← links)
- Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem (Q2382677) (← links)
- On equilibria for ADM minimization games (Q2429352) (← links)
- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (Q2827800) (← links)
- (Q3194371) (← links)
- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology (Q3408178) (← links)
- An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings (Q3637100) (← links)
- Assignment of add–drop multiplexer (ADM) rings and digital cross-connect system (DCS) mesh in telecommunication networks (Q4658428) (← links)
- Structural Information and Communication Complexity (Q5710090) (← links)
- Approximation and Online Algorithms (Q5713444) (← links)
