Traffic grooming algorithm using shortest EDPs table in WDM mesh networks

Lecture Notes in Computer Science

Volumn 3515, Issue II, 2005, Pages 559-567

  Lee, Seungsoo ^a   Lee, Tae Jin ^a   Chung, Min Young ^a   Choo, Hyunseung ^a  

^a Sungkyunkwan University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; RESOURCE ALLOCATION; WAVELENGTH DIVISION MULTIPLEXING; LIGHT TRANSMISSION; WIRELESS MESH NETWORKS (WMN);

EDGE DISJOINT PATH (EDP); MESH NETWORKS; RESOURCE UTILIZATION; TRAFFIC GROOMING; EDGE DISJOINT PATHS; NETWORK ENVIRONMENTS; NETWORK THROUGHPUT; RESEARCH COMMUNITIES; RESOURCE UTILIZATIONS; TRAFFIC GROOMING ALGORITHMS; TRANSMISSION CAPABILITY; WDM MESH NETWORK;

COMPUTER NETWORKS; MESH NETWORKING;

EID: 25144435449     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11428848_73     Document Type: Conference Paper

References (6)

1. H. Choo, M. Son, M.Y. Chung and T.J. Lee, "Shared Protection by Concatenated Rings in Optical WDM Networks," Springer-Verlag LNCS, vol. 3042, pp. 1476-1482, May 2004.
2. P. Manohar, D. Manjunath and R.K. Shevgaonkar, "Routing and Wavelength Assignment in Optical Network From Edge Disjoint Path Algorithms," IEEE Communications Letters, vol. 6, pp. 211-213, May 2002.
3. M.H. Kim, H. Choo, B.H. Yae, J.H. Lee, "A Practical RWA Algorithm Based on Lookup Table for Edge Disjoint Paths," Springer-Verlag LNCS, vol. 2713, pp. 138-147, June 2003.
4. H. Choo, and V.V. Shakhov, "Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths," Springer-Verlag LNCS, vol. 3038, pp. 1138-1145, June 2004.
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 Trans. Networking, vol. 11, pp. 285-299, Apr. 2003.
6. 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.