Dynamic traffic grooming using hop constraint lightpath establishment approach

This paper considers the dynamic routing issues in WDM grooming networks. Given network resources, a major objective of a routing algorithm is to minimize the blocking probability of connection requests. Wavelengths and transceivers are usually limited resources in a network. The way to use these resources directly determines the network performance. So the challenge is how to use wavelength resources efficiently while keeping higher transceiver-utilization efficiency. To solve this problem, we develop an approach called Hop Constrain Lightpath Establishment Approach (HCLEA). The main idea of HCLEA is to guide the routing algorithms not to create inefficient long lightpaths. Simulation results show that HCLEA does improve the network performance in terms of transceiver-utilization efficiency, wavelength-utilization utilization, and bandwidth blocking ratio.

[1]  Biswanath Mukherjee,et al.  Dynamic traffic grooming in WDM mesh networks using a novel graph model , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[2]  Biswanath Mukherjee,et al.  Traffic grooming for survivable WDM networks - shared protection , 2003, IEEE J. Sel. Areas Commun..

[3]  Biswanath Mukherjee,et al.  On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks , 2002, Optical Fiber Communication Conference and Exhibit.

[4]  Sheng Wang,et al.  Dynamic routing and assignment of wavelength algorithms in multifiber wavelength division multiplexing networks , 2000, IEEE Journal on Selected Areas in Communications.

[5]  Gurusamy Mohan,et al.  An efficient dynamic protection scheme in integrated IP/WDM networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..