Throughput maximization in traffic grooming in WDM mesh networks

Abstract

We consider the problem of efficient grooming of low‐speed connections onto high‐capacity lightpaths in WDM mesh networks. Maximizing the throughput and minimizing the network cost are the two most important objectives of the traffic grooming problem. It may not be possible to achieve both the goals simultaneously. We present an efficient heuristic algorithm to maximize throughput without compromising on the network cost. Our algorithm decides the placement of the transceivers at the nodes instead of operating on a fixed number of transceivers. Multihop routing and rerouting techniques have been used to achieve higher throughput. We use a two stage ILP approach to enable comparison of our algorithm with the optimum. We also present simulation results to contrast the performance of our approach with two recently proposed heuristic algorithms.