Optical grooming with grooming ratio eight
DOI10.1016/J.DAM.2009.03.019zbMath1202.68021OpenAlexW2120940232MaRDI QIDQ967318
Gennian Ge, Charles J. Colbourn, Alan C. H. Ling
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.03.019
optical networksblock designswavelength-division multiplexingcombinatorial designstraffic groominggroup-divisible designs
Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Cryptography (94A60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optical grooming with grooming ratio nine
- Graph designs for the eight-edge five-vertex graphs
- Resolvable path designs
- Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs
- Grooming in unidirectional rings: \(K_{4}-e\) designs
- Minimizing drop cost for SONET/WDM networks with ? wavelength requirements
- A survey on the existence ofG-Designs
- On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks
- Grooming for two-period optical networks
- Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs
- Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
- Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven
- Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6
This page was built for publication: Optical grooming with grooming ratio eight