On the complexity of the traffic grooming problem in optical networks

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

Volumn 4475 LNCS, Issue , 2007, Pages 262-271

  Shalom, Mordechai ^a,c   Unger, Walter ^b   Zaks, Shmuel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c TEL HAI COLLEGE   (Israel)

Author keywords

Add drop multiplexer(ADM); Optical networks; Wavelength assignment; Wavelength division multiplexing(WDM)

Indexed keywords

OPTICAL SWITCHES; PROBLEM SOLVING; SET THEORY; WAVELENGTH; WAVELENGTH DIVISION MULTIPLEXING;

ADD-DROP MULTIPLEXERS; GROOMING FACTORS; LIGHTPATHS; SWITCHING COST; TRAFFIC GROOMING PROBLEMS; WAVELENGTH ASSIGNMENT;

FIBER OPTIC NETWORKS;

EID: 38049056215     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72914-3_23     Document Type: Conference Paper

References (16)

1. Bermond, J.-C., Braud, L., Coudert, D.: Traffic grooming on the path. In: 12th Colloqium on Structural Information and Communication Complexity, Le Mont Saint-Michel, France (May 2005)
2. Bermond, J.-C., Coudert, D.: Traffic grooming in unidirectional WDM ring networks using design theory. In: IEEE ICC, Anchorage, Alaska (May 2003)
3. Cǎlinescu, G., Frieder, O., Wan, P.-J.: Minimizing electronic line terminals for automatic ring protection in general WDM optical networks. IEEE Journal of Selected Area on Communications 20(1), 183-189 (2002)
4. Chiu, A.L., Modiano, E.H.: Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Journal of Lightwave Technology 18(1), 2-12 (2000)
5. Cälinescu, G., Wan, P.-J.: Traffic partition in WDM/SONET rings to minimize SONET ADMs. Journal of Combinatorial Optimization 6(4), 425-453 (2002)
6. Dutta, R., Huang, S., Rouskas, G.N.: Traffic grooming in path, star and tree networks: Complexity, bounds, and algorithms. IEEE Journal on Selected Areas in Communications 24(4), 66-82 (2006)
7. Epstein, L., Levin, A.: Better bounds for minimizing SONET ADMs. In: 2nd Workshop on Approximation and Online Algorithms, Bergen, Norway (September 2004)
8. Eilam, T., Moran, S., Zaks, S.: Lightpath arrangement in survivable rings to minimize the switching cost. IEEE Journal of Selected Area on Communications 20(1), 172-182 (2002)
9. Flammini, M., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, Springer, Heidelberg (2005)
10. Goldschmidt, O., Hochbaum, D.S., Levin, A., Olinick, E.V.: The sonet edge-partition problem. NETWORKS 41(1), 32-37 (2003)
11. Garey, M., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
12. Gerstel, O., Lin, P., Sasaki, G.: 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, pp. 69-77 (1998)
13. Gerstel, O., Ramaswami, R., Sasaki, G.: Cost effective traffic grooming in WDM rings. In: INFOCOM'98, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies (1998)
14. Huang, S.: Traffic Grooming in Wavelength Routed Path Networks. PhD thesis, North Carolina State University (2002)
15. Shalom, M., Zaks, S.: 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, pp. 254-262, October (2004)
16. Zhu, K., Mukherjee, B.: A review of traffic grooming in WDM optical networks: Architecture and challenges. Optical Networks Magazine 4(2), 55-64 (2003)