Abstract
Elastic optical networking is considered a promising candidate to improve the spectral efficiency of optical networks. One of the most important planning challenges of elastic optical networks is the NP-hard routing and spectrum assignment (RSA) problem. In this paper, we investigate offline RSA in elastic filterless optical networks, which use a passive broadcast-and-select architecture to offer network agility. Here, an elastic optical network is referred to as the optical network that can adapt the channel bandwidth, data rate, and transmission format for each traffic demand in order to offer maximum throughput. In elastic filterless networks, the presence of unfiltered signals resulting from the drop-and-continue node architecture must be considered as an additional constraint in the RSA problem. In this paper, first, the RSA problem in elastic filterless networks is formulated by using an integer linear program to obtain optimal solutions for small networks. Due to the problem complexity, two efficient RSA heuristics are also proposed to achieve suboptimal solutions for larger networks in reasonable time. Simulation results show that significant bandwidth savings in elastic filterless networks can be achieved compared with the fixed-grid filterless solutions. The proposed approach is further tested in multi-period traffic scenarios and combined with periodical spectrum defragmentation, leading to additional improvement in spectrum utilization of elastic filterless optical networks.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call