Practical dynamic traffic grooming in large WDM mesh networks

The problem of dynamic traffic grooming in optical mesh networks is usually solved by applying the Dijsktra's algorithm on an auxiliary graph. Although such algorithms can give very good performance since they have a global view of the whole network, they are very time-consuming and thus cannot be applied in large networks. Therefore, maybe for the first time, we propose a heuristic algorithm to reduce the required computations by minimizing the size of the graph. The simulations in a typical mesh network conclusively demonstrate that our algorithm is very time-efficient while performing better than existing algorithms.