Approximation algorithms for traffic grooming in WDM rings

IEEE International Conference on Communications

Volumn , Issue , 2009, Pages

  Corcoran, Kevin ^a   Flaxman, Seth ^b   Neyer, Mark ^c   Scherpelz, Peter ^d   Weidert, Craig ^e   Libeskind Hadas, Ran ^f  

^a UNIVERSITY OF OREGON   (United States)

^b EPFL   (Switzerland)

^c UNIVERSITY OF NORTH CAROLINA   (United States)

^d UNIVERSITY OF CHICAGO   (United States)

^e SIMON FRASER UNIVERSITY   (Canada)

^f Harvey Mudd College   (Denmark)

Author keywords

Approximation algorithms; Optical networks; Traffic grooming; WDM rings

Indexed keywords

FIBER OPTIC NETWORKS; MULTIMEDIA SERVICES; POLYNOMIAL APPROXIMATION; PROFITABILITY; VIDEO ON DEMAND;

ADD DROP MULTIPLEXERS; BANDWIDTH DEMAND; DESTINATION NODES; LARGER NETWORKS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; THEORETICAL PERFORMANCE; TRAFFIC GROOMING; WDM RING;

APPROXIMATION ALGORITHMS;

EID: 70449491505     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2009.5198761     Document Type: Conference Paper

References (14)

1. O. Gerstel, R. Ramaswami, and G. H. Sasaki, "Cost-effective traffic grooming in WDM rings," IEEE/ACM Transactions on Networking, vol. 8, no. 5, pp. 618-630, 2000.
2. C. Law and K.-Y. Siu, "Online routing and wavelength assignment in single-hub WDM rings," IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, October 2000.
3. K. Zhu and B. Mukherhee, "A review of traffic grooming in WDM optical networks: Architectures and challenges," Optical Networks Magazine, vol. 4, no. 2, March/April 2003.
4. B. Chen, G. N. Rouskas, and R. Dutta, "Traffic grooming in WDM ring networks to minimize the electronic port cost," Optical Switching and Networking, vol. 2, no. 1, pp. 1-18, May 2005.
5. B. Ramamurthy and A. Ramakrishnan, "Virtual topology reconfiguration of wavelength-routed optical wdmnetworks," in Proceedings of GLOBECOM 2000, vol. 2, 2000, pp. 1269-1275.
6. H. Liu and F. A. Tobagi, "Traffic grooming in WDM SONET UPSR rings with multiple line speeds," in Proceedings IEEE Infocom 2005, 2005.
7. G. Maier, A. Pattavina, S. D. Patre, and M. Martinelli, "Optical network survivability: Protection techniques in the WDM layer," Photonic Network Communications, vol. 4, pp. 251-269, 2002.
8. J. Bermond, D. Coudert, and X. Munoz, "Traffic grooming in unidirectional WDM ring networks: the all-to-all u nitary case," in 7th IFIP Working Conference on Optical Network Design & Modelling, 2003.
9. T. Y. Chow and P. J. Lin, "The ring grooming problem," Networks, vol. 44, no. 3, 2004.
10. R. Dutta and G. N. Rouskas, "On optimal traffic grooming in WDM rings," IEEE Journal on Selected Areas in Communication, vol. 20, no. 1, January 2002.
11. Caprara, Kellerer, and Pferschy, "The multiple subset sum problem," SIJOP: SIAM Journal on Optimization, vol. 11, 2000. [Online]. Available: http://citeseer.ist.psu.edu/caprara98multiple.html
12. C. Chekuri and S. Khanna, "A polynomial time approximation scheme for the multiple knapsack problem," SICOMP, vol. 35, no. 3, pp. 713-728, 2006.
13. H. Kellerer, "A polynomial time approximation scheme for the multiple knapsack problem." in RANDOM-APPROX, ser. Lecture Notes in Computer Science, D. S. Hochbaum, K. Jansen, J. D. P. Rolim, and A. Sinclair, Eds., vol. 1671. Springer, 1999, pp. 51-62.
14. O. H. Ibarra and C. E. Kim, "Fast approximation algorithms for the knapsack and sum of subset problems," J. ACM, vol. 22, no. 4, pp. 463-468, 1975.