首页 | 本学科首页   官方微博 | 高级检索  
     检索      

多条件QoS路由选择的一个动态规划算法
引用本文:吴景岚,朱文兴.多条件QoS路由选择的一个动态规划算法[J].莆田学院学报,2013(5):59-62.
作者姓名:吴景岚  朱文兴
作者单位:[1]闽江学院计算机科学系,福建福州350108 [2]福州大学数学与计算机学院,福建福州350108
基金项目:国家自然科学基金资助项目(61070020)
摘    要:研究具有可加性和可乘性参数约束的QoS路由选择问题,以丢失率约束为例,给出了把问题的可乘性参数约束变换为可加性约束的方法,据此给出具有丢失率约束最小时延问题的一个线性0-1规划模型。利用该变换,对一个简单的网络拓扑,给出了该问题的一个动态规划算法,算法具有拟多项式时间复杂性。

关 键 词:QoS路由选择  动态规划算法  时延  线性0-1规划  丢失率

A Dynamic Programming Approach for Multi-constrained QoS Routing Problem
WU Jing-lan,ZHU Wen-xing.A Dynamic Programming Approach for Multi-constrained QoS Routing Problem[J].journal of putian university,2013(5):59-62.
Authors:WU Jing-lan  ZHU Wen-xing
Institution:1. Department of Computer Science, Minjiang University, Fuzhou Fujian 350108, China; 2. College of Mathematics and Computer Science, Fuzhou University, Fuzhou Fujian 350108, China )
Abstract:The QoS routing problem with multiple addible and multiplicable constraints was considered in this paper. A method was proposed to transform multiplicable constraints such as loss rate constraint equivalently into addible constraints. By using this method, the minimization of time delay subject was modeled to a loss rate constraint over a simple network as a linear 0-1 programming problem, and a pseudo-polynomial time dynamic programming algorithm was presented.
Keywords:QoS routing  dynamic programming  delay  linear 0-1 programming  loss rate
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号