Lightpath Admission Control in Dynamic Optical Transport Networks

Abstract

In dynamic optical transport networks, the Lightpath Admission Control (LAC) is the task that finds a Routing and Wavelength Assignment (RWA) solution for the current lightpath request or blocks it when there are not enough free available resources. We propose a LAC method, based on integer linear programming, that decides the RWA solution for the current request aiming to maximize the acceptance probability of the future lightpath requests. We compare the method with traditional shortest path based approaches. We show that the blocking probability is significantly improved with LAC decision times of a few seconds, on average.