Performance evaluation of spectrum allocation policies for elastic optical networks

This paper analyses the performances of major conventional spectrum allocation policies in elastic optical networks, in terms of time complexity, blocking probability and contiguous aligned available slot ratio. Simulation results show that the first-last fit allocation policy outperforms in terms of blocking probability and contiguous aligned available slot ratio compared to other spectrum allocation policies considered in this paper. Further, we observe that the time complexity of the first-last fit spectrum allocation policy is minimum, which is the same as that of the first fit and random policies.