Relative Least Impact Dynamic Lightpath Provisioning Algorithm for Multi-Fiber WDM Network
Paper ID : 1155-IST
Fariborz Mousavi Madani *
In the classic dynamic lightpath provisioning scheme, path selection and wavelength assignment decisions were made on the basis of mere availability of network resources to accommodate an incoming request. In this work, mean offered load to each node pair and ongoing network status information were advantageously utilized to develop heuristics for informed RWA decision attempting to find the route and wavelength that impose minimal impact on blocking of future incoming requests. In contrast with some recent works which require knowledge of lightpath holding time or employ rerouting of other established lightpaths which incurs undesirable disruptions, proposed heuristics require mean traffic load only which can be easily acquired via traffic policing schemes. Moreover, significant reduction in blocking probability compared with classical dynamic RWA could be achieved without complicated processing-intensive ILP formulations within tractable computation time which suit practical implementation.
Dynamic lightpath provisioning, RWA, blocking probability