Traffic grooming algorithm using shortest EDPs table in WDM mesh networks

Authors:
Seungsoo Lee;Tae-Jin Lee;Min Young Chung;Hyunseung Choo
Affiliations:
Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Year:
2005

Citing 3
Cited 4

A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks

IEEE/ACM Transactions on Networking (TON)
A practical RWA algorithm based on lookup table for edge disjoint paths

HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Traffic grooming in an optical WDM mesh network

IEEE Journal on Selected Areas in Communications

Grooming of traffic using improved evolutionary algorithm in universal optical network

ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Traffic grooming, routing, and wavelength assignment in an optical WDM mesh networks based on clique partitioning

Photonic Network Communications
Distributed dynamic grooming routing and wavelength assignment in WDM optical mesh networks

Photonic Network Communications
Routing in WDM based wireless mesh networks with capacity estimation

International Journal of Internet Protocol Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In optical networks with huge transmission capability, Wavelength Division Multiplexing (WDM) has been actively studied in the research community. Traffic grooming technology based on divided bandwidth of a wavelength by WDM is very important for the network cost. This paper proposes a traffic grooming algorithm that employs the table for shortest Edge Disjoint Paths (EDPs) with clever selection on demands. Comprehensive simulations in various network environments show that the proposed algorithm outperforms well-known Maximizing Resource Utilization (MRU) up to 15% for the network throughput and up to 17% for the running time.