TY - JOUR
T1 - Optical grooming with grooming ratio eight
AU - Colbourn, Charles
AU - Ge, Gennian
AU - Ling, Alan C H
N1 - Funding Information:
Research of the first author is supported by DOD grant N00014-08-1-1070. Research of the second author was supported by the National Outstanding Youth Science Foundation of China under Grant No. 10825103, National Natural Science Foundation of China under Grant No. 10771193, Specialized Research Fund for the Doctoral Program of Higher Education, Program for New Century Excellent Talents in University, and Zhejiang Provincial Natural Science Foundation of China.
PY - 2009/7/6
Y1 - 2009/7/6
N2 - Grooming uniform all-to-all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The minimum possible drop cost is determined for grooming ratio 8, and this cost is shown to be realized with six exceptions, and 37 possible exceptions, the largest being 105.
AB - Grooming uniform all-to-all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The minimum possible drop cost is determined for grooming ratio 8, and this cost is shown to be realized with six exceptions, and 37 possible exceptions, the largest being 105.
KW - Block designs
KW - Combinatorial designs
KW - Group-divisible designs
KW - Optical networks
KW - Traffic grooming
KW - Wavelength-division multiplexing
UR - http://www.scopus.com/inward/record.url?scp=67349198631&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67349198631&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2009.03.019
DO - 10.1016/j.dam.2009.03.019
M3 - Article
AN - SCOPUS:67349198631
SN - 0166-218X
VL - 157
SP - 2763
EP - 2772
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 13
ER -