Approximating the traffic grooming problem with respect to ADMs and OADMs (extended abstract)

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

Volumn 5168 LNCS, Issue , 2008, Pages 920-929

  Flammini, Michele ^a   Monaco, Gianpiero ^a   Moscardelli, Luca ^a,b   Shalom, Mordechai ^c   Zaks, Shmuel ^d  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF SALERNO   (Italy)

^c TEL HAI COLLEGE   (Israel)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Add Drop Multiplexer(ADM); Optical Add Drop Multiplexer(OADM); Optical Networks; Path and Ring Networks; Traffic Grooming; Wavelength Division Multiplexing(WDM)

Indexed keywords

COLOR; FIBER OPTIC NETWORKS; NUCLEAR PROPULSION; OPTICAL PROPERTIES; POLYNOMIAL APPROXIMATION; RADIOMETERS; REUSABILITY; TREES (MATHEMATICS);

ADD-DROP MULTIPLEXER(ADM); APPROXIMATION RATIOS; CHAIN NETWORKS; INTERMEDIATE NODES; LIGHTPATHS; NEW ALGORITHM; NP-COMPLETE; OPTICAL ADD-DROP MULTIPLEXER(OADM); OPTICAL NETWORKS; OPTICAL-; PARALLEL PROCESSING; PATH AND RING NETWORKS; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; RING NETWORKS; SWITCHING COMPONENTS; TRAFFIC GROOMING; WAVELENGTH DIVISION MULTIPLEXING(WDM);

APPROXIMATION ALGORITHMS;

EID: 51849102465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85451-7_99     Document Type: Conference Paper

References (22)

1. Amini, O., Pérennes, S., Sau, I.: Hardness and approximation of traffic grooming. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 561-573. Springer, Heidelberg (2007)
2. Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph Problems Arising from wavelength-routing in all- optical networks. In: Proc. 2nd Workshop on Optics and Computer Science, WOCS 1997 (April 1997)
3. Bérmond, J.-C., Braud, L., Coudert, D.: Traffic grooming on the path. In: 12 th Colloqium on Structural Information and Communication Complexity, Le Mont Saint-Michel, France (May 2005)
4. Bermond, J.-C., Coudert, D.: Traffic grooming in unidirectional WDM ring networks using design theory. In: IEEE ICC, Anchorage, Alaska (May 2003)
5. Brackett, C.A.: Dense wavelength division multiplexing networks: principles and applications. IEEE Journal on Selected Areas in Communications 8, 948-964 (1990)
6. Chen, B., Rouskas, G.N., Dutta, R.: Traffic grooming in star networks. In: Broad-nets (2004)
7. Chen, B., Rouskas, G.N., Dutta, R.: Traffic grooming in wdm ring networks with the min-max objective. In: NETWORKING, pp. 174-185 (2004)
8. 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)
9. Calinescu, 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)
10. Calinescu, G., Wan, P.-J.: Traffic partition in wdm/sonet rings to minimize sonet adms. Journal of Combinatorial Optimization 6(4), 425-453 (2002)
11. Dor, D., Tarsi, M.: Graph decomposition is np-complete: A complete proof of holyer's conjecture. SIAM Journal on Computing 26(4), 1166-1187 (1997)
12. Du, D.H.C., Vetter, R.J.: Distributed computing with high-speed optical networks. In: Proceeding of IEEE Computer, vol. 26, pp. 8-18 (1993)
13. 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)
14. Epstein, L., Levin, A.: Better bounds for minimizing sonet adms. In: 2nd Workshop on Approximation and Online Algorithms, Bergen, Norway (September 2004)
15. Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem in tree and star neetworks. Journal of Parallel and Distributed Computing (to appear, 2008)
16. Flammini, M., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem. In: Deng, X., Du, D. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 915-924. Springer, Heidelberg (2005)
17. Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a wdm ring to minimize cost of embedded sonet rings. In: INFOCOM 1998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies (1998)
18. Gerstel, O., Ramaswami, R., Sasaki, G.: Cost effective traffic grooming in wdm rings. In: INFOCOM 1998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies (1998)
19. Green, P.E.: Fiber-Optic Communication Networks. Prentice Hall, Englewood Cliffs (1992)
20. Klasing, R.: Methods and problems of wavelength-routing in all-optical networks. In: Proceeding of the MFCS 1998 Workshop on Communication, August 24-25, Brno, Czech Republic, pp. 1-9 (1998)
21. Shalom, M., Unger, W., Zaks, S.: On the complexity of the traffic grooming problem in optical networks. In: Fun with Algorithms, 4th International Conference, Castiglioncello, Italy, pp. 262-271 (June 2007)
22. Shalom, M., Zaks, S.: A 10/7 + e approximation scheme for minimizing the number of adms in sonet rings. In: First Annual International Conference on Broadband Networks, San-Jose, California, USA (October 2004)