A dynamic and quasi-centralized RWA method for optical fast circuit switching networks employing route pre-prioritization

We propose a new dynamic RWA algorithm for optical fast circuit switching networks, agile optical networks that can accommodate changing broadband demands. The algorithm utilizes pre-computed prioritized route candidates that reflect statistical information such as traffic distribution characteristics to attain better load balancing. The route priority is periodically distributed over a network and RWA for each path connection demand is processed in a distributed manner. Numerical experiments demonstrate that the algorithm matches the performance of a centralized RWA algorithm that uses all the necessary information on a network.

► We propose a new dynamic RWA algorithm for optical fast circuit switching networks. ► The algorithm utilizes statistical information and attains better load balancing. ► The algorithm can be performed in a quasi-centralized manner. ► We elucidated that the algorithm matches the performance of a centralized RWA algorithm.