Approximating the traffic grooming problem

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

Volumn 3827 LNCS, Issue , 2005, Pages 915-924

  Flammini, Michele ^a   Moscardelli, Luca ^a   Shalom, Mordechai ^b   Zaks, Shmuel ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Add Drop Multiplexer(ADM); Optical Networks; Traffic Grooming; Wavelength Assignment; Wavelength Division Multiplexing(WDM)

Indexed keywords

APPROXIMATION THEORY; COLORING; FIBER OPTIC NETWORKS; GRAPH THEORY; NUMBER THEORY; PROBLEM SOLVING; WAVELENGTH DISPERSIVE SPECTROSCOPY; WAVELENGTH DIVISION MULTIPLEXING;

ADD-DROP MULTIPLEXER(ADM); APPROXIMATION ALGORITHMS; OPTICAL NETWORKS; TRAFFIC GROOMING; WAVELENGTH ASSIGNMENT;

TELECOMMUNICATION TRAFFIC;

EID: 33744950616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_91     Document Type: Conference Paper

References (13)

1. K. Zhu and B. Mukherjee. A review of traffic grooming in wdm optical networks: Architecture and challenges. Optical Networks Magazine, 4(2):55-64, March-April 2003.
2. O Gerstel, P. Lin, and G. Sasaki. Wavelength assignment in a wdm ring to minimize cost of embedded sonet rings. In INFOCOM'98, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, pages 69-77, 1998.
3. T. Eilam, S. Moran, and S. Zaks. Lightpath arrangement in survivable rings to minimize the switching cost. IEEE Journal of Selected Area on Communications, 20(1):172-182, Jan 2002.
4. G. Cǎlmescu and P-J. Wan. Traffic partition in wdm/sonet rings to minimize sonet adms. Journal of Combinatorial Optimization, 6(4):425-453, 2002.
5. M. Shalom and S. Zaks. A 10/7 + ε approximation scheme for minimizing the number of adms in sonet rings. In First Annual International Conference on Broadband Networks, San-José, California, USA, October 2004.
6. L. Epstein and A. Levin. Better bounds for minimizing sonet adms. In 2nd Workshop on Approximation and Online Algorithms, Bergen, Norway, September 2004.
7. G. Cǎlinescu, Ophir Frieder, and Peng-Jun Wan. Minimizing electronic line terminals for automatic ring protection in general wdm optical networks. IEEE Journal of Selected Area on Communications, 20(1):183-189, Jan 2002.
8. O. Gerstel, R. Ramaswami, and G. Sasaki. Cost effective traffic grooming in wdm rings. In INFOCOM'98, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, 1998.
9. A. L. Chiu and E. H. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in wdm ring networks. Journal of Lightwave Technology, 18(1):2-12, January 2000.
10. J-C. Bermond and D. Coudert. Traffic grooming in unidirectional WDM ring networks using design theory. In IEEE ICC, Anchorage, Alaska, May 2003.
11. Jean-Claude Bérmond, Laurent Braud, and David Coudert. Traffic grooming on the path. In 12th Colloqium on Structural Information and Communication Complexity, Le Mont Saint-Michel, France, May 2005.
12. M. Shalom, W. Unger, and S. Zaks. On the complexity of the traffic grooming problem. In preparation, 2005.
13. V. Chvátal. A greedy heuristic for the set covering problem. Mathematics of Operation Research, 4:233-235, 1979.