A practical and cost-effective approach to efficient traffic grooming in WDM mesh networks

In this chapter, we present a new scheme for traffic grooming in WDM mesh networks. We propose a new node architecture which brings together all the three qualities desired: practical feasibility, cost-effectiveness and efficient grooming capability. None of the models considered so far in the literature have managed to satisfy all three criteria. We achieve these three ideals by considering a combination of groomers at multiple traffic granularities. We also present an algorithm for efficient traffic grooming with this new architecture. We justify the need for this new algorithm by imposing our node architecture on existing algorithms and comparing with them through a wide range of simulations. © 2005 Springer-Verlag US.