Traffic grooming based on Shortest path in optical WDM mesh networks

Abstract

This paper investigates the static traffic grooming in WDM optical mesh networks. Our objective is to improve the network throughput and to minimize the blocking probability. As take care of this problem efficiently, we propose Shortest-path First Traffic grooming(SFT) algorithm. The comprehensive computer simulation shows that our proposed algorithm is up to about 14% superior to the existing one known to be effective. © Springer-Verlag Berlin Heidelberg 2005.