Drop cost and wavelength optimal two-period grooming with ratio 4

Details Drop cost and wavelength optimal two-period grooming with ratio 4 Drop cost and wavelength optimal two-period grooming with ratio 4

2009-11-18

arxiv.org/abs/0911.3475v1

Mathematics

Combinatorics

Scientific paper

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-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 ADMs) for any $n,v$ and C=4 and $C' \in \{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 $K_n$ 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.

Affiliated with

Also associated with

No associations

Rating

Drop cost and wavelength optimal two-period grooming with ratio 4 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Drop cost and wavelength optimal two-period grooming with ratio 4, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Drop cost and wavelength optimal two-period grooming with ratio 4 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-240613