Date Added: Mar 2010
In this paper, a new algorithm for dynamic traffic grooming is introduced. It considers the holding-time of the connections and it aims at balancing the load among existing lightpaths to avoid the formation of bottlenecks and, consequently, high blocking probability values. Results indicate that it produces significantly lower blocking probabilities when compared to other holding-time-aware algorithm. Moreover, it promotes a fair distribution of blocking among source-destination pairs. The huge amount of available bandwidth in the Wavelength Division Multiplexing (WDM) networks can be largely underutilized due to the disparity between the capacity of wavelengths and the bandwidth demand of IP traffic streams.