A framework for hierarchical traffic grooming in WDM networks of general topology

2nd International Conference on Broadband Networks, BROADNETS 2005

Volumn 2005, Issue , 2005, Pages 167-176

  Bensong, Chen ^a   Rouskas, George N ^a   Dutta, Rudra ^a  

^a North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC PORTS; INTER CLUSTER TRAFFIC; MESH NETWORKS; MULTIGRANULAR NETWORKS;

ALGORITHMS; BROADBAND NETWORKS; ELECTRONIC EQUIPMENT; HIERARCHICAL SYSTEMS; TELECOMMUNICATION TRAFFIC; WAVELENGTH DIVISION MULTIPLEXING;

TOPOLOGY;

EID: 33847025709     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICBN.2005.1589611     Document Type: Conference Paper

References (19)

1. S. Baroni and P. Bayvel. Wavelength requirements in arbitrary connected wavelength-routed optical networks. IEEE/OSA J. Lightwave Technol, 15(2):242-251, Feb. 1997.
2. Bensong Chen. Hierarchical Traffic Grooming in Large-Scale WDM Networks. PhD thesis, North Carolina State University, Raleigh, NC, August 2005.
3. I. Chlamtac, A. Ganz, and G. Karmi. Lightpath communications: An approach to high bandwidth optical WANS. IEEE Transactions on Communications, 40(7):1171-1182, July 1992.
4. Z. Ding and M. Hamdi. Clustering techniques for traffic grooming in optical WDM mesh networks. In IEEE GLOBECOM 2002, volume 3,17-21, pages 2711-2715, Nov 2002.
5. R. Dutta and G. N. Rouskas. On optimal traffic grooming in WDM rings. IEEE Journal on Selected Areas in Communications, 20(1):110-121, January 2002.
6. R. Dutta and G. N. Rouskas. Traffic grooming in WDM networks: Past and future. IEEE Network, 16(6):46-56, November/December 2002.
7. M. Esfandiari, S. Gloeckle, A. Zolfagheri, G. Clapp, J. Gannett, H. Kobrinski, V. Poudyal, and R. Skoog. Improved metro network design by grooming and aggregation of STS-1 demands into oc-192/oc-48 lightpaths. In NFOEC 2003, September 2003.
8. O. Gerstel, R. Ramaswami, and G. Sasaki. Cost-effective traffic grooming in WDM rings. IEEE/ACM Transactions on Networking, 8(5):618-630, October 2000.
9. J.Q. Hu and B. Leida. Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks. Proceedings of the IEEE INFOCOM 2004, 23(1):495-501, March 2004.
10. Z.K.G. Patrocínio Jr. and G. R. Mateus. A lagrangian-based heuristic for traffic grooming in WDM optical networks. In IEEE GLOBECOM 2003, volume 5,1-5, pages 2767-2771, Dec 2003.
11. G. Karypis and V. Kumar. A fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 1998.
12. V. R. Konda and T. Y. Chow. Algorithm for traffic grooming in optical networks to minimize the number of transceivers. In IEEE Workshop on High Performance Switching and Routing, pages 218-221, 2001.
13. C. Lee and E. K. Park. A genetic algorithm for traffic grooming in all-optical mesh networks. In IEEE SMC 2002, volume 7, 6-9, Oct 2002.
14. D. Li, Z. Sun, X. Jia, and K. Makki. Traffic grooming on general topology WDM networks. IEE Proc. Commun., 150(3):197-201, June 2003.
15. H. Siregar, H. Takagi, and Y. Zhang. Efficient routing and wavelength assignment in wavelength-routed optical networks. Proc. 7th Asia-Pacific Network Oper. and Mgmt Symposium, pages 116-127, Oct. 2003.
16. P-J. Wan, G. Calinescu, L. Liu, and O. Frieder. Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal on Selected Areas in Communications, 18(10):1995-2003, 2000.
17. D. West. Introduction to Graph Theory. Prentice Hall, 1996.
18. H. Zhu, H. Zang, K. Zhu, and B. Mukherjee. A novel generic graph model for traffic grooming in heterogeneous wdm mesh networks. IEEE/ACM Transactions on Networking, 11(2):285-299, April 2003.
19. K. Zhu and B. Mukherjee. Traffic grooming in an optical WDM mesh network. IEEE Journal on Selected Areas in Communications, 20(1):122-133, Jan 2002.