多加性QoS约束下的链路分离路由算法  

Link-disjoint routing algorithm under multiple additive QoS constraints

作　　者：熊轲[1,2] 裘正定[1] 张煜[1] 张宏科[3] 

机构地区：[1]北京交通大学计算机与信息技术学院,北京100044 [2]清华大学电子工程系,北京100084 [3]北京交通大学电子信息工程学院,北京100044

出　　处：《通信学报》2010年第6期127-135,共9页Journal on Communications

基　　金：国家重点基础研究发展计划("973"计划)基金资助项目(2007CB307101);教育部科技创新工程重大项目培育资金项目(706005);高等学校学科创新引智计划("111计划")基金资助项目(B08002)~~

摘　　要：对多个加性QoS约束下的链路分离路径问题进行了研究,针对现有算法求解结果依赖于网络结构,难以保证对任意网络都可求得可行解和最优解的问题,提出了一种与网络结构无关的多约束链路分离路径路由算法(MCLPRA,multiple constrained link-disjoint path routing algorithm)。该算法基于SAMCRA,采用对解空间先分类,然后按类进行处理和搜索的方法,引入了控制搜索深度的参数,可保证对任意网络都能求得可行解。理论分析表明,MCLPRA能够在现有算法不能求解的情况下解得可行解和最优解。仿真结果显示,MCLPRA的可行解平均求解成功率明显高于现有算法且所求路径对长度也比现有算法更短。The problem of finding link-disjoint paths under multiple additive QoS constraints was studied.Since the existing algorithms depended on network’s structure and could not guarantee to find feasible solutions for arbitrary net-works,a novel algorithm called multiple constrained link-disjoint path routing algorithm（MCLPRA） was proposed.MCLPRA was based on SAMCRA and didn’t rely on the network’s structure.By introducing the parameter to control its search depth,dividing the solution space into different classes and performing searching according to the classes respectively,MCLPRA was able to obtain the feasible solutions for arbitrary networks.Theoretic analysis shows that MCLPRA can get the feasible and optimal solutions when traditional schemes can not.Comprehensive simulations also show that MCLPRA has better performances than existing algorithms in terms of higher average successful rate of getting feasible solutions with shorter average total length of the obtained path pair.

关 键 词：服务质量路由 链路分离 可靠路由 多约束路由 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]