Embedding path designs in 4-cycle systems
Discrete Mathematics
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6
SIAM Journal on Discrete Mathematics
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Journal of Graph Theory
Optical grooming with grooming ratio eight
Discrete Applied Mathematics
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven
SIAM Journal on Discrete Mathematics
Traffic grooming in WDM networks
IEEE Communications Magazine
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
We study grooming for two-period optical networks, a variation of the traffic grooming problem for wavelength division multiplexed (WDM) ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period grooming problem, during the first period of time there is all-to-all uniform traffic among $n$ nodes, each request using $1/C$ of the bandwidth; and during the second period there is all-to-all uniform traffic only among a subset $V$ of $v$ nodes, each request now being allowed to use $1/C'$ of the bandwidth, where $C'