Better bounds for minimizing SONET ADMs

Lecture Notes in Computer Science

Volumn 3351, Issue , 2005, Pages 281-294

  Epstein, Leah ^a   Levin, Asaf ^b  

^a INTERDISCIPLINARY CENTER   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COSTS; ROUTERS; TELECOMMUNICATION TRAFFIC;

ADD-DROP MULTIPLEXERS (ADM); APPROXIMATION ALGORITHMS; TRAFFIC STREAMS; WAVELENGTHS;

WAVELENGTH DIVISION MULTIPLEXING;

EID: 23944472740     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31833-0_23     Document Type: Conference Paper

References (4)

1. G. Calinescu and P.-J. Wan, "Traffic partition in WDM/SONET rings to minimize SONET ADMs," Journal of Combinatorial Optimization, 6, 425-453, 2002.
2. O. Gerstel, P. Lin and G. Sasaki, "Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings," Proc. INFOCOM 1998, 1, 94-101, 1998.
3. L. Liu, X. Li, P.-J. Wan and O. Frieder, "Wavelength assignment in WDM rings to minimize SONET ADMs," Proc. INFOCOM 2000, 2, 1020-1025, 2000.
4. P.-J. Wan, G. Calinescu, L. Liu and O. Frieder, "Grooming of arbitrary traffic in SONET/WDM BLSRs," IEEE Journal on Selected Areas in Communications, 18, 1995-2003, 2000.