Performance Analysis of Sparse Traffic Grooming in WDM Mesh Networks

Authors

Wang Yao, University of Nebraska-LincolnFollow
Mengke Li, University of Nebraska-LincolnFollow
Byrav Ramamurthy, University of Nebraska-LincolnFollow

Date of this Version

2005

Comments

Published in ICC 2005. 2005 IEEE International Conference on Communications, 2005. Copyright 2005 IEEE. Used by permission.

Abstract

Sparse traffic grooming is a practical problem to be addressed in heterogeneous multi-vendor optical WDM networks where only some of the optical cross-connects (OXCs) have grooming capabilities. Such a network is called as a sparse grooming network. The sparse grooming problem under dynamic traffic in optical WDM mesh networks is a relatively unexplored problem. In this work, we propose the maximize-lightpath-sharing multi-hop (MLS-MH) grooming algorithm to support dynamic traffic grooming in sparse grooming networks. We also present an analytical model to evaluate the blocking performance of the MLS-MH algorithm. Simulation results show that MLSMH outperforms an existing grooming algorithm, the shortest path single-hop (SPSH) algorithm. The numerical results from analysis show that it matches closely with the simulation. The effect of the number of grooming nodes in the network on the blocking performance is also analyzed.