TY - JOUR
T1 - Drop cost and wavelength optimal two-period grooming with ratio 4
AU - Bermond, Jean Claude
AU - Colbourn, Charles
AU - Gionfriddo, Lucia
AU - Quattrocchi, Gaetano
AU - Sau, Ignasi
PY - 2010
Y1 - 2010
N2 - 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′ < C. We determine the minimum drop cost (minimum number of add-drop multiplexers (ADMs)) for any n,v and C = 4 and C′ ∈ {1,2,3}. To do this, we use tools of graph decompositions. Indeed the two-period grooming problem corresponds to minimizing the total number of vertices in a partition of the edges of the complete graph Kn into subgraphs, where each subgraph has at most C edges and where furthermore it contains at most C′ edges of the complete graph on v specified vertices. Subject to the condition that the two-period grooming has the least drop cost, the minimum number of wavelengths required is also determined in each case.
AB - 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′ < C. We determine the minimum drop cost (minimum number of add-drop multiplexers (ADMs)) for any n,v and C = 4 and C′ ∈ {1,2,3}. To do this, we use tools of graph decompositions. Indeed the two-period grooming problem corresponds to minimizing the total number of vertices in a partition of the edges of the complete graph Kn into subgraphs, where each subgraph has at most C edges and where furthermore it contains at most C′ edges of the complete graph on v specified vertices. Subject to the condition that the two-period grooming has the least drop cost, the minimum number of wavelengths required is also determined in each case.
KW - Design theory
KW - Graph decomposition
KW - Optical networks
KW - SONET ADM
KW - Traffic grooming
UR - http://www.scopus.com/inward/record.url?scp=77954481345&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77954481345&partnerID=8YFLogxK
U2 - 10.1137/080744190
DO - 10.1137/080744190
M3 - Article
AN - SCOPUS:77954481345
SN - 0895-4801
VL - 24
SP - 400
EP - 419
JO - SIAM Journal on Discrete Mathematics
JF - SIAM Journal on Discrete Mathematics
IS - 2
ER -