Dynamically Provisioned Priority-Aware Algorithms in Shared Mesh Optical Networks

Abstract

The paper introduces two novel algorithms, one each for static and dynamic traffic types, to improve the availability of high priority connection requests over shared mesh optical networks. The proposed algorithms are a complementary study to the previous work. The paper also proposes a new metric, maximum path availability, by which the proposed algorithms improve the performance of high priority requests by reducing blocking probability, increasing availability satisfaction rate, and with better resource utilization using dynamic negotiation of service level agreement parameters between a customer and service providers. In a multi-homed network topology, the introduced algorithms along with the proposed metric can help the customers to modify, refine and further process the final connection requests to better comply with service providers’ network capacity. The simulation results show improvements on preserving the high priority class of traffic for both static and dynamic traffic types compared to other protection schemes in shared mesh optical networks.