.png){kind=icon}
返回
Priority Assignment Algorithms for Shared Mesh Protection Switching
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2018.2884988.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Priority assignment
protection switching
shared mesh protection
transport network
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
分享收藏Dictamnine inhibits pancreatic cancer cell growth and epithelial-mesenchymal transition by blocking the PI3K/AKT signaling pathway.png)
Neoplasma
OAAI
NeoplasmaIF0
OAAI分享收藏
查看更多内容