| 求最大数目不相交多约束QoS路由的一种新方法 |
| |
| 引用本文： | 陈流豪,倪明放,高石云.求最大数目不相交多约束QoS路由的一种新方法[J].军事通信技术,2011(1). |
| |
| 作者姓名： | 陈流豪 倪明放 高石云 |
| |
| 作者单位： | 解放军理工大学通信工程学院研究生1队;解放军理工大学通信工程学院电信工程系; |
| |
| 基金项目： | 国家自然科学基金资助项目(70971136) |
| |
| 摘 要： | 针对多约束QoS路由问题中从资源点到目的点的最大数目的不相交路由,文章给出了一种基于罚函数与整数规划的求满足QoS约束的最大数目的互不相交路由算法。该算法利用了路由模型的结构特性,使整数规划问题转化为线性规划问题,初步的算例表明算法是有效的。
|
| 关 键 词： | 多约束服务质量路由 不相交路由 完全幺模矩阵 整数规划 |
A New Method for Solving Maximal Number's Arc Disjoint Multi-Constrained QoS Routing |
| |
| CHEN Liu-hao,NI Ming-fang,GAO Shi-yun.A New Method for Solving Maximal Number's Arc Disjoint Multi-Constrained QoS Routing[J].Journal of Military Communications Technology,2011(1). |
| |
| Authors: | CHEN Liu-hao NI Ming-fang GAO Shi-yun |
| |
| Institution: | CHEN Liu-hao1,NI Ming-fang2,GAO Shi-yun1(1.Postgraduate Team 1 ICE,PLAUST,Nanjing 210007,China,2.Department of Telecommunications Engineering ICE,PLAUST) |
| |
| Abstract: | In order to solve the maximal number's arc disjoint paths from sources point to destination point,a method based on penalty function and integer programming is introduced,which satisfies QoS constraints.This algorithm makes use of the structure's trait of routing model and translates the integer programming problem to linear programming problem.Primitive illustration indicates this algorithm is valid. |
| |
| Keywords: | multi-constrained QoS routing disjoint routing totally unimodular matrices integer programming |
| 本文献已被 CNKI 等数据库收录！ |
