Traffic grooming in WDM ring networks with the min-max objective

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3042, Issue , 2004, Pages 174-185

  Chen, Bensong ^a   Rouskas, George N ^a   Dutta, Rudra ^a  

^a North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION;

DYNAMIC TRAFFIC; MINMAX OBJECTIVE; POLYNOMIAL-TIME ALGORITHMS; PROBLEM INSTANCES; TRAFFIC DEMANDS; TRAFFIC GROOMING; WAVELENGTH ASSIGNMENT; WDM RING NETWORKS;

COSTS;

EID: 33645439156     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24693-0_15     Document Type: Article

References (5)

1. Dutta, R., Rouskas, G.N.: A survey of virtual topology design algorithms for wave-length routed optical networks. Optical Networks 1 (2000) 73-89
2. Dutta, R., Rouskas, G.N.: Traffic grooming in WDM networks: Past and future. IEEE Network 16 (2002) 46-56
3. Dutta, R., Rouskas, G.N.: On optimal traffic grooming in WDM rings. IEEE Journal on Selected Areas in Communications 20 (2002) 110-121
4. Chen, L.W., Modiano, E.: Efficient routing and wavelength assignment for reconfigurable WDM networks with wavelength converters. In: IEEE INFOCOM. (2003)
5. Chen, B., Rouskas, G.N., Dutta, R.: Traffic grooming in WDM rings with the Min-Max objective. Technical report, North Carolina State Univ., Raleigh, NC (2003)