Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
From MaRDI portal
Publication:4804166
DOI10.1002/net.10061zbMath1014.05051MaRDI QIDQ4804166
Jean-Claude Bermond, Stéphan Ceroi
Publication date: 10 April 2003
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00071959/file/RR-4626.pdf
05C90: Applications of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
90B20: Traffic problems in operations research
Related Items
A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks, Optical grooming with grooming ratio nine, Grooming traffic to minimize load, Optical grooming with grooming ratio eight, Grooming in unidirectional rings: \(K_{4}-e\) designs, Traffic grooming on the path, Embedding path designs into kite systems, Optimal Groomings with Grooming Ratios Six and Seven, Lower bounds for two-period grooming via linear programming duality, Grooming for two-period optical networks
Cites Work