%0 Journal Article
%T Exact Algorithm for Multi-Constrained Shortest Link-Disjoint Paths<br>多约束最短链路分离路径精确算法
%A XIONG Ke
%A QIU Zheng-Ding
%A GUO Yu-Chun
%A ZHANG Hong-Ke
%A QIN Ya-Juan
%A <br>熊轲
%A 裘正定
%A 郭宇春
%A 张宏科
%A 秦雅娟
%J 软件学报
%D 2010
%I 
%X Finding two link-disjoint QoS paths (primary and backup) between source-destination pairs is one of the most significant schemes to provide reliable QoS routing. Current algorithms for seeking multi-constrained link-disjoint path pair (MCLPP) can not always make sure to find the feasible solutions in networks. To solve this problem, this paper analyzes the properties of the optimal solution of MCLPP problem, and then proposes a design principle for the exact algorithm. Based on the design principle, an exact algorithm called link-disjoint optimal multi-constrained paths algorithm (LIDOMPA) is presented, which is able to find multi-constrained shortest link-disjoint path pair for arbitrary networks. To reduce the complexity, this paper introduces three key concepts: The candidate optimal solution, the constricted constraint vector and the structure-aware non-dominance, which effectively reduce the search space of LIDOMPA without loss of exactness. Extensive experiments show that LIDOMPA outperforms the existing algorithms in terms of the ability of obtaining solutions and achieves acceptable running time overhead.
%K QoS routing?
%K network reliability
%K link-disjoint paths
%K multi-constrained routing
%K optimal solution<br>服务质量路由
%K 网络可靠性
%K 链路分离路径
%K 多约束路由
%K 最优解
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=4DB66BCE1717FE0144E7899F77CA301F&yid=140ECF96957D60B2&vid=659D3B06EBF534A7&iid=DF92D298D3FF1E6E&sid=93ACFBACE750BC19&eid=43E2C08889D1FABC&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=17