Priority Assignment Algorithms for Maximum Protection Ratio in Shared Mesh Protection

Shared mesh protection is a fault recovery mechanism that is used for the fast recovery of traffic when a network failure occurs. Protection paths having different endpoints share their resources leading to the contention of services when multiple failures occur. Preemption is to be done when many s...

Full description

Saved in:
Bibliographic Details
Published in2021 International Conference on Computer Communication and Informatics (ICCCI) pp. 1 - 7
Main Authors Lalaji, Krishnendu, Eapen, Remya Annie
Format Conference Proceeding
LanguageEnglish
Published IEEE 27.01.2021
Subjects
Bandwidth
Computer security
Informatics
mesh network
Mesh networks
Optimization
optimization problem
priority assignment
Resource management
shared mesh protection
Switched mode power supplies
Online AccessGet full text
DOI10.1109/ICCCI50826.2021.9402440

Cover

More Information
Summary:Shared mesh protection is a fault recovery mechanism that is used for the fast recovery of traffic when a network failure occurs. Protection paths having different endpoints share their resources leading to the contention of services when multiple failures occur. Preemption is to be done when many services contest for the same resources. The optimization problem is to maximize the total protected services for any failure case. To find the optimal priority set, algorithms such as depth-based algorithm, minimum degree algorithm and capacity density algorithm are used. In this paper, we propose Hungarian capacity density algorithm to find the optimal priority set. The performance of all the algorithms are compared with respect to the protection ratio.
DOI:10.1109/ICCCI50826.2021.9402440