文献类型：会议论文

英文题名：A minimum cost active and backup path algorithm with SRLG constraints

作者：Yang, Yongqiang[1]; Mi, Huichao[1]; Zhang, Xiaowen[1]

第一作者：杨永强

通讯作者：Yang, Y.|[1048412ae69c9a5]杨玉;

机构：[1] College of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou Henan, China

第一机构：河南财经政法大学计算机与信息工程学院

通讯机构：[1]College of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou Henan, China|[1048412]河南财经政法大学计算机与信息工程学院;[10484]河南财经政法大学;

会议论文集：Proceedings - 6th International Conference on Internet Computing for Science and Engineering, ICICSE 2012

会议日期：April 21, 2012 - April 23, 2012

会议地点：Zhengzhou, Henan, China

语种：英文

外文关键词：Costs - Risk management - Routing algorithms

摘要：As more mission critical services are transported over high-speed networks, it is important to study the service quality and correlations among multiple link/node networks. In this paper, we propose a novel algorithm called Low Cost an S-Disjoint (LCSD) paths algorithm. The algorithm is based on a SRLG disjoint active and backup paths for network protection. The backup path can be used to avoid the risk sharing with active path. We conduct theoretical analysis and experiments. The results show that LCSD algorithm can be used to solve both trap problem and path-pair total-cost non-optimal problem under SRLG disjoint constraint. Compared with RF and TF algorithms, the LCSD algorithm is of significant superiority in a ratio to find feasible solution. It can guarantee minimum total cost of active and backup path. ? 2012 IEEE.