Introducing a Relative Priority for the Shared-Protection Schemes

Abstract

Abstract-One of the major challenges of optical network operators is ensuring the stringent levels of availability required by their highest class clients. To achieve this, we introduce relative priorities among the different primary connections contending for access to the shared-protection paths. In this paper, we provide an analytical model for the proposed priority-enabled scheme. As a key distinguishing feature from existing literature, we derive explicit analytic expressions for the average availability and service disruption rate for the different priority classes.

Minimizing protection switching time in transport networks with shared mesh protection

“…In the first and second cases of SPP, N working paths share one or more protection paths between one end node pair. Previous works, 17‐19 as studies belonging to the first and second cases, adopt a priority‐aware protection scheme in the context of availability, which is defined as the probability that the service will be found in the normal operating state at a random time in the future 20 . In the third case of SPP, resources of protection paths are shared among multiple end node pairs.…”

Incorporating mutation probability into priority-aware protection in optical networks

“…However, from a quality of service perspective, these schemes are not optimal since they don't account for the different availability requirements of the failing primary optical connections during the course of recovery. This limitation led the authors in [3], [4] to define the so-called priority-aware shared protection scheme which differs from the classical scheme in that failed primary connections are recovered in an order consistent with their respective priority levels. In this context, the priority of a failed connection is determined by its availability requirement where a more stringent requirement translates into a higher urgency level during restoration.…”