| 求不相交QoS路由的一种整数线性规划方法 |
| |
| 引用本文： | 倪明放,高石云,武欣嵘,童玮.求不相交QoS路由的一种整数线性规划方法[J].控制与决策,2012,27(10):1597-1600. |
| |
| 作者姓名： | 倪明放 高石云 武欣嵘 童玮 |
| |
| 作者单位： | 解放军理工大学通信工程学院,南京,210007 |
| |
| 基金项目： | 国家自然科学基金项目(70971136) |
| |
| 摘 要： | 提出求解不相交QoS路由问题的一种整数线性规划方法.首先,利用一个0-1变量集合来表示不相交路由和路由的QoS需求;然后,通过拉格朗日乘子将集合中的复杂约束引入所导出的整数线性规划问题的目标函数中.因为约束系数矩阵是全幺模矩阵,所以这类整数线性规划问题能用单纯形法容易地求解,从而可在求解线性规划问题的迭代过程中求出不相交QoS路由.数值实验结果表明了所提出方法的有效性.
|
| 关 键 词： | QoS路由 链路不相交路由 整数规划 全幺模矩阵 |
| 收稿时间： | 2011/3/28 0:00:00 |
| 修稿时间： | 2011/9/28 0:00:00 |
An Integer Linear Program Method of Finding Link-disjoint Paths For QoS Routing |
| |
| NI Ming-fang,GAO Shi-yun,WU Xin-rong,TONG Wei.An Integer Linear Program Method of Finding Link-disjoint Paths For QoS Routing[J].Control and Decision,2012,27(10):1597-1600. |
| |
| Authors: | NI Ming-fang GAO Shi-yun WU Xin-rong TONG Wei |
| |
| Affiliation: | (Institute of Communications Engineering,PLA University of Science and Technology,Nanjing 210007,China.) |
| |
| Abstract: | An integer linear program method is developed to deal with the problem of finding link-disjoint paths for QoS routing.Firstly,a set of 0-1 variables is given to model link-disjoint paths and QoS constraints.Then the complicating constraints are included in the objective function of the integer linear program problem formulated by Lagrangian multipliers.The integer linear program problem can be solved rapidly by using simplex algorithm for the totally unimodular of the constraint matrix.Furthermore link-disjoint paths for QoS routing can be found in the iterate process of solving linear program problems.Numerical experiment results show the effectiveness of the proposed method. |
| |
| Keywords: | QoS routing link-disjoint paths integer programming totally unimodular matrix |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《控制与决策》浏览原始摘要信息 |
|
点击此处可从《控制与决策》下载全文 |
|
