Abstract-In this paper, we address the traffic grooming problem in WDM mesh networks with dynamic unicast traffic. We develop a dynamic tree grooming algorithm (DTGA) that can support multi-hop traffic grooming by taking advantage of light-trees. In this algorithm, a light-tree can be dropped, branched, and extended when a route is to be established for a new request. In order to implement the DTGA, we develop a layered graph model which can support different routing policies. Extensive simulation shows that DTGA has better performance than lightpath-based algorithms when transceivers are limited.
In REF , the authors propose a dynamically changing light-tree model using a layered graph to address the problem.
An algorithm for traffic grooming in WDM mesh networks with dynamically changing light-trees
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.
Computer Science