scholarly journals Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem

2021 ◽  
Vol 195 ◽  
pp. 523-531
Author(s):  
Marcelo Bianchetti ◽  
Javier Marenco
Top ◽  
2018 ◽  
Vol 26 (3) ◽  
pp. 465-488
Author(s):  
Federico Bertero ◽  
Marcelo Bianchetti ◽  
Javier Marenco

2017 ◽  
Vol 63 (4) ◽  
pp. 423-429 ◽  
Author(s):  
Ireneusz Olszewski

Abstract The considered problem covers routing and spectrum allocation problem (RSA problem) in Elastic Optical Networks while maintaining the spectrum continuity constraints, non-overlapping spectra constraints for adjacent connections on individual links of the network and spectrum contiguity constraints of the connection. In this article the modified version of the First Fit spectrum slot allocation policy for Fixed Alternate Routing in flexible optical networks has been proposed. The Fixed Alternate Routing with proposed spectrum allocation policy rejects fewer requests, provides less bandwidth blocking probability and less spectrum fragmentation than Fixed Alternate Routing with well-known First Fit and Exact Fit spectrum allocation policies. However, the cost of improving these parameters is a higher computational complexity of the proposed allocation policy.


Author(s):  
Shahzad Alam ◽  
Muhammad Umar Masood ◽  
Ihtesham Khan ◽  
Arsalan Ahmad ◽  
Salman Ghafoor ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document