Traffic grooming in a passive star WDM network

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

Volumn 3104, Issue , 2004, Pages 1-12

  Angel, Eric ^a   Bampis, Evripidis ^a   Pascual, Fanny ^a  

^a UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

Author keywords

Algorithm; Approximation; Star; Traffic grooming; WDM network

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPLEX NETWORKS; CONSTRAINED OPTIMIZATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION; STARS; WAVELENGTH DIVISION MULTIPLEXING;

APPROXIMATION; COMBINATORIAL OPTIMIZATION PROBLEMS; HIGH-SPEED CHANNELS; MATCHING PROBLEMS; MATCHING TECHNIQUES; POLYNOMIAL-TIME ALGORITHMS; TRAFFIC GROOMING; WDM NETWORKS;

PASSIVE NETWORKS;

EID: 34447579691     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27796-5_1     Document Type: Article

References (4)

1. M.R. Garey, D.S. Johnson, Computers and Intractability. H.Freeman and Co., New York, 1979.
2. R. Dutta, G.N. Rouskas, On Optimal Traffic Grooming in WDM Rings. IEEE Journal on selected areas in communications, Vol. 20, No. 1, January 2002.
3. S. Rajagopalan, V.V. Vazirani, Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM Journal on Computing, 28:526-541, 1999.
4. B. Shepherd, A. Vetta, The demand matching problem. IPCO 2002, published in Lecture Notes in Computer Science Vol. 2337, pages 457-474, 2002.