Grooming traffic to minimize load
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1602124 (Why is no real title available?)
- scientific article; zbMATH DE number 3981181 (Why is no real title available?)
- scientific article; zbMATH DE number 3720936 (Why is no real title available?)
- scientific article; zbMATH DE number 553911 (Why is no real title available?)
- scientific article; zbMATH DE number 3378938 (Why is no real title available?)
- A new class of group divisible designs with block size three
- Embedding Partial Steiner Triple Systems
- Grooming for two-period optical networks
- Grooming in unidirectional rings: \(K_{4}-e\) designs
- Lower bounds for two-period grooming via linear programming duality
- Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
- Minimizing SONET adms in unidirectional WDM rings with grooming ratio seven
- Optical grooming with grooming ratio eight
- The SONET edge‐partition problem
- Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6
Cited in
(9)- Clustering-learning model for reducing the delay in traffic grooming optimization
- Grooming for two-period optical networks
- Drop cost and wavelength optimal two-period grooming with ratio 4
- Optical grooming with grooming ratio nine
- Graph partitioning and traffic grooming with bounded degree request graph
- Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs
- Telecommunication network grooming
- Lower bounds for two-period grooming via linear programming duality
- Optical grooming with grooming ratio eight
This page was built for publication: Grooming traffic to minimize load
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658091)