Approximating the traffic grooming problem in tree and star networks

Journal of Parallel and Distributed Computing

Volumn 68, Issue 7, 2008, Pages 939-948

  Flammini, Michele ^a   Monaco, Gianpiero ^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; Tree networks; Wavelength division multiplexing (WDM)

Indexed keywords

APPROXIMATION ALGORITHMS; FIBER OPTIC NETWORKS; POLYNOMIALS; TELECOMMUNICATION TRAFFIC; TOPOLOGY; WAVELENGTH DIVISION MULTIPLEXING;

ADD-DROP MULTIPLEXER (ADM); GROOMING PATHS; TRAFFIC GROOMING;

TREES (MATHEMATICS);

EID: 44449147393     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2008.01.003     Document Type: Article

References (27)

1. B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, U. Vaccaro, Graph problems arising from wavelength-routing in all-optical networks, in: Proc. 2nd Workshop on Optics and Computer Science, WOCS'97, April 1997
2. J.-C. Bermond, L. Braud, D. Coudert, Traffic grooming on the path, in: 12 th Colloqium on Structural Information and Communication Complexity, Le Mont Saint-Michel, France, May 2005
3. J.-C. Bermond, D. Coudert, Traffic grooming in unidirectional WDM ring networks using design theory: in: IEEE ICC, Anchorage, Alaska, May 2003
4. Brackett C.A. Dense wavelength division multiplexing networks: Principles and applications. IEEE Journal on Selected Areas in Communications 8 (1990) 948-964
5. Cǎlinescu G., Frieder O., and 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 (2002) 183-189
6. Cǎlinescu G., and Wan P.-J. Traffic partition in wdm/sonet rings to minimize sonet adms. Journal of Combinatorial Optimization 6 4 (2002) 425-453
7. B. Chen, G.N. Rouskas, R. Dutta, Traffic grooming in star networks, in: Broadnets, 2004
8. B. Chen, G.N. Rouskas, R. Dutta, Traffic grooming in wdm ring networks with the min-max objective, in: Networking, 2004, pp. 174-185
9. Chiu A.L., and Modiano E.H. Traffic grooming algorithms for reducing electronic multiplexing costs in wdm ring networks. Journal of Lightwave Technology 18 1 (2000) 2-12
10. Chung N.K., Nosu K., and Winzer G. Special issue on dense wdm networks. IEEE Journal on Selected Areas in Communications 8 (1990)
11. Du D.H.C., and Vetter R.J. Distributed computing with high-speed optical networks. Proceeding of IEEE Computer vol. 26 (1993) 8-18
12. Dutta R., Huang S., and Rouskas G.N. Traffic grooming in path, star, and tree networks: Complexity, bounds, and algorithms. IEEE Journal on Selected Areas in Communications 24 4 (2006)
13. Eilam T., Moran S., and Zaks S. Lightpath arrangement in survivable rings to minimize the switching cost. IEEE Journal of Selected Area on Communications 20 1 (2002) 172-182
14. L. Epstein, A. Levin, Better bounds for minimizing sonet adms. in: 2nd Workshop on Approximation and Online Algorithms, Bergen, Norway, September 2004
15. M. Flammini, L. Moscardelli, M. Shalom, S. Zaks, Approximating the traffic grooming problem, in: ISAAC, 2005, pp. 915-924
16. Garey M., and Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-Completeness (1979), Freeman
17. Gargano L., and Vaccaro U. Routing in all-optical networks: Algorithmic and graph-theoretic problems. Numbers, Information and Complexity (2000), Kluwer Academic
18. O. Gerstel, P. Lin, 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, 1998
19. O. Gerstel, R. Ramaswami, G. Sasaki, Cost effective traffic grooming in wdm rings, in: INFOCOM'98, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, 1998
20. Green P.E. Fiber-Optic Communication Networks (1992), Prentice Hall
21. Hinton H.S. Architectural considerations for photonic switching networks. IEEE Journal on Selected Areas in Communications 6 (1988) 1209-1226
22. Johnson D.S. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9 (1974) 256-278
23. R. Klasing, Methods and problems of wavelength-routing in all-optical networks, in: Proceeding of the MFCS'98 Workshop on Communication, August 24-25, Brno, Czech Republic, 1998, pp. 1-9
24. Personik S. Review of fundamentals of optical fiber systems. IEEE Journal on Selected Areas in Communications 3 (1983) 373-380
25. Ramaswami R. Multi-wavelength lightwave networks for computer communication. IEEE Communications Magazine 31 (1993) 78-88
26. M. Shalom, W. Unger, S. Zaks, On the complexity of the traffic grooming problem in optical networks, in: FUN, 2007, pp. 262-271
27. M. Shalom, S. Zaks, A 10/7 + ε{lunate} 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