상세정보
학술지
Priority Assignment Algorithms for Shared Mesh Protection Switching
- 발행일
- 201903
- 출처
- IEEE Transactions on Communications, v.67 no.3, pp.2130-2143
- ISSN
- 0090-6778
- 출판사
- IEEE
- 협약과제
- 18HR1500, 안전한 무인이동체를 위한 ICT 기반기술 개발, 안재영
- 초록
- Shared mesh protection (SMP) is a protection mechanism that recovers traffic delivery against failures on a working path as rapidly as linear protection. In addition, it allows for resource sharing among the protection paths with different endpoints in a mesh network by coordinating the use of shared resources when multiple protection paths compete for these resources. Owing to limited protection resources and the preemption in consequence of priority comparison, the SMP introduces a new optimization problem whose objective is to find the optimal priority assignment that maximizes the number of protected services against any failure case for a given SMP network. In this paper, we recognize that the problem of finding the optimal solution is NP-hard and propose min-degree and capacity-density approximation algorithms, whose approximation ratios are presented with the maximum degree of services and the maximum capacity of segments of an SMP network. Moreover, we propose a depth-based algorithm that always finds the optimal solution for a hypertree-shaped SMP network. We compare the performance of the proposed algorithms in terms of the protection ratio, which we define in this paper.
- KSP 제안 키워드
- Density approximation, Maximum degree, Mesh Network, NP-hard, Optimal Solution, Optimization problem, Protection mechanism, Protection switching, Shared resources, approximation algorithms, maximum capacity