Abstract
There is a mismatch between lightpath channel capacity and traffic request capacity in wavelength division multiplexed (WDM) optical mesh networks. Traffic grooming is needed to resolve this mismatch in an efficient way. We study the dynamic traffic grooming problem in WDM mesh networks using the fixed-alternate routing (FAR) approach. Based on the FAR approach, we propose the fixed-order grooming (FOG) algorithm to support on-line provisioning of multi-granularity subwavelength connections. As traffic grooming involves two-layered routing, it is significantly different from the routing and wavelength assignment (RWA) problem in wavelength-routed WDM networks. We introduce the route selection problem (also called grooming node selection problem) and propose three grooming policies to address this problem. The three grooming policies are load sharing (LS), sequential grooming (SG) and minimum gap (MG). To address the wavelength and transceiver constraints, we propose another three grooming policies including least physical hop first (LPH), least virtual hop first (LVH) and least stringent resource first (LSR). Simulations are conducted to evaluate the performance of the FOG grooming algorithm and the grooming policies.
Byrav Ramamurthy
Professor & PI
My research areas include optical and wireless networks, peer-to-peer networks for multimedia streaming, network security and telecommunications. My research work is supported by the U.S. National Science Foundation, U.S. Department of Energy, U.S. Department of Agriculture, NASA, AT&T Corporation, Agilent Tech., Ciena, HP and OPNET Inc.