Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven
From MaRDI portal
Publication:5189502
DOI10.1137/070709141zbMath1185.68024MaRDI QIDQ5189502
Charles J. Colbourn, Gennian Ge, Alan C. H. Ling, Hung-Lin Fu, Hui-Chuan Lu
Publication date: 17 March 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070709141
optical networks; block designs; wavelength-division multiplexing; combinatorial designs; traffic grooming; group-divisible designs
68M10: Network design and communication in computer systems
68R05: Combinatorics in computer science
Related Items
A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks, Group Divisible Designs with Block Size Four and Group Type for, Group divisible designs with block size four and group type \(g^um^1\) for more small \(g\), Group divisible designs with block size four and group type \(g^um^1\), Some new classes of 2-fold optimal or perfect splitting authentication codes, Optical grooming with grooming ratio nine, Grooming traffic to minimize load, Graph divisible designs and packing constructions, Optical grooming with grooming ratio eight, Traffic grooming in bidirectional WDM ring networks, Optimal Groomings with Grooming Ratios Six and Seven, Grooming for two-period optical networks
