Dynamic Grooming with Capacity aware Routing and Wavelength Assignment for WDM based Wireless Mesh Networks

摘要

Wavelength division multiplexing (WDM) based wireless mesh networks (WMNs) are emerging as a new technology having enormous resources such as bandwidth and high throughput to satisfy the end users requirements. In this paper, we propose a Dynamic Grooming with Capacity aware Routing and Wavelength (DGCRW) assignment algorithm for such networks. To choose an optimized route, a cost value (CV) metric is proposed as the existing routing metric hop count does not give optimal results in WMNs for some applications (Zhao et al., J sys softw 83:1318-1326, 2010). A Utilization Matrix (UM) having load value (LV) is constructed dynamically as the requests for path/(light path) construction flow through the nodes. Using UM, utilization rating (UR) for each link is calculated. Finally CV is calculated from UR. The minimum value of CV is chosen to construct the path between source and destination. The value of CV is compared with existing hop count metric. The proposed algorithm is simulated on WDM based NSFNet network. The results obtained show that the proposed algorithm is quite effective to route the packets to less congested path and has higher throughput and less blocking probability than the other proposed algorithms.