Dynamic traffic grooming in WDM mesh networks using a novel graph model

Conference Record / IEEE Global Telecommunications Conference

Volumn 3, Issue , 2002, Pages 2681-2685

  Zhu, Hongyue ^a   Zang, Hui ^b   Zhu, Keyao ^a   Mukherjee, Biswanath ^a  

^a Davis   (United States)

^b Sprint Applied Research & Advanced Technology Labs California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; NETWORKS (CIRCUITS); TELECOMMUNICATION TRAFFIC;

GRAPH MODEL;

WAVELENGTH DIVISION MULTIPLEXING;

EID: 0036972097     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. X. Zhang and C. Qiao, "An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings," IEEE/ACM Transactions on Networking, vol. 8, pp. 608-617, October 2000.
2. O. Gerstel, R. Ramaswami, and G. H. Sasaki, "Cost-effective traffic grooming in WDM rings," IEEE/ACM Transactions on Networking, vol. 8, pp. 618-630, October 2000.
3. K. Zhu and B. Mukherjee, "Traffic grooming in WDM optical mesh networks," IEEE Journal on Selected Areas in Communications, vol. 20, pp. 122-133, January 2002.
4. S. Thiagarajan and A. Somani, "Traffic grooming for survivable mesh networks," in Proc., OPTICOMM '01, (Denver, CO), August 2001.
5. 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, accepted for publication.