Traffic grooming in optical WDM mesh networks using the blocking island paradigm

摘要

Traffic Grooming has emerged as a key technology that can effectively utilize the huge bandwidth in optical networks by aggregating low-speed traffic streams into high-capacity lightpaths. Most of previous work focused on traffic grooming in ring networks. With the network topology evolves from rings to meshes, traffic grooming in mesh networks is becoming more and more important. In this paper, we are trying to study this problem by minimizing overall network cost that includes the transceivers required as well as the number of wavelengths. A mathematical formulation of the traffic grooming problem in mesh networks is proposed. We also describe a heuristic using Blocking Island (BI) paradigm. Simulations have been carried out to prove effectiveness of our heuristic.