Traffic grooming in path, star, and networks: Complexity, bounds, and algorithms

Performance Evaluation Review

Volumn 31, Issue 1, 2003, Pages 298-299

  Dutta, Rudra ^a   Huang, Shu ^a   Rouskas, George N ^a  

^a North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646177279     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/885651.781066     Document Type: Conference Paper

References (8)

1. A. L. Chiu and E. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Journal of Lightwave Technology, 18(1):2-12, Jan. 2000.
2. R. Dutta and G. N. Rouskas. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks, 1(1):73-89, January 2000.
3. R. Dutta and G. N. Rouskas. On optimal traffic grooming in WDM rings. Proc. ACM SIGMETRICS, pp. 164-174, June 2001.
4. R. Dutta and G. N. Rouskas. Traffic grooming in WDM networks: Past and future. IEEE Network, 16(6):46-56, 2002.
5. M. R. Garey and D. S. Johnson, Computers and Intractability. W. H. Freeman and Co., New York.
6. O. Gerstel, R. Ramaswami, and G. Sasaki. Cost-effective traffic grooming in WDM rings. IEEE/ACM Trans. Network., 8(5):618-630, 2000.
7. S. Huang. Traffic Grooming in Wavelength Routed Path Networks. North Carolina State University. M.S. thesis, 2002. http://www.lib.ncsu.edu/ETD-db/
8. K. Zhu and B. Mukherjee. Traffic grooming in an optical WDM mesh network. IEEE JSAC, 20(1):122-133, Jan 2002.