Traffic grooming algorithm using shortest EDPs table in WDM mesh networks

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. © Springer-Verlag Berlin Heidelberg 2005.