Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
Jean-Claude Bermond, Charles J. Colbourn, Lucia Gi...