Time-Varying Spectrum Allocation Policies and Blocking Analysis in Flexible Optical Networks

2013 ◽  
Vol 31 (1) ◽  
pp. 13-25 ◽  
Author(s):  
Konstantinos Christodoulopoulos ◽  
Ioannis Tomkos ◽  
Emmanouel Varvarigos
2017 ◽  
Vol E100.B (6) ◽  
pp. 962-973 ◽  
Author(s):  
Mirai CHINO ◽  
Misato KAMIO ◽  
Jun MATSUMOTO ◽  
Eiji OKI ◽  
Satoru OKAMOTO ◽  
...  

2013 ◽  
Vol 31 (1) ◽  
pp. 26-38 ◽  
Author(s):  
Miroslaw Klinkowski ◽  
Marc Ruiz ◽  
Luis Velasco ◽  
Davide Careglio ◽  
Victor Lopez ◽  
...  

2014 ◽  
Vol 19 (1) ◽  
pp. 35-44
Author(s):  
Ireneusz Olszewski

Abstract The problem of service time-varying traffic in flexible transparent optical networks, assuming that the incoming connections and their duration are not known in advance, is considered in this work. Time-varying traffic requires dynamic spectrum allocation for connections implemented in the network. In the considered problem, a path with the required spectrum around the reference frequency is determined for each incoming connection by the routing algorithm. In order to take into account the dynamic spectrum allocation for the connections in the network, two spectrum expansion/- contraction schemes have been applied on the basis of which the average blocking probability for the incoming request additional slot was determined.


Sign in / Sign up

Export Citation Format

Share Document