Tunable availability-aware and bandwidth efficient provisioning in optical mesh networks

Availability is an important metric to measure the quality of service (QoS) in a resilience network. It can usually be provided by using protection, either shared or dedicated. On the other hand, there is a trade-off between guaranteeing availability and resource efficiency usage in the network. In this study, we propose an algorithm that jointly considers availability and resource efficiency in an optical network. Our proposed algorithm first indicates the critical links in the network and save these links for future as far as it provisions the connections. We observe that exploiting the maximum flow problem helps to conceptualize a new way to significantly decrease blocking in availability-aware routing. Through extensive simulation experiments, we evaluate the presented algorithm for different service levels and demonstrate that the proposed algorithm outperforms the traditional one in blocking probability and resource efficiency.