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

一种基于非精确状态信息的QoS单播路由改进算法
引用本文:陈有汉,桂志波. 一种基于非精确状态信息的QoS单播路由改进算法[J]. 南京邮电大学学报(自然科学版), 2007, 27(3): 62-66
作者姓名:陈有汉  桂志波
作者单位:南京邮电大学,计算机学院,江苏,南京,210003
基金项目:江苏省高校自然科学基金 , 江苏省高校自然科学基金
摘    要:传统的QoS保障的单播路由算法都假设IP网络结点的状态信息可以被准确地获知,但实际网络存在许多因素使得状态信息非精确.所设计的改进算法是通过动态确定k优路径算法(k_shortest algorithm)中的k值,从而确保最终求得的路径相对其他算法所求得路径是更优的.因此能有效地降低了丢包率,提高了端到端延迟绑定的概率,通过网络仿真器Ns的仿真分析,结果表明了该算法的有效性.

关 键 词:QoS路由  非精确状态  单播  路由算法  非精确  状态信息  单播路由算法  改进算法  Information  State  Uncertain  Based  Routing Algorithm  Unicast  有效性  结果  仿真分析  仿真器  通过网络  概率  迟绑定  端到端  丢包率  路径算法
文章编号:1673-5439(2007)03-0062-05
收稿时间:2006-10-20
修稿时间:2006-10-202007-03-12

An Improved QoS Unicast Routing Algorithm Based on Uncertain State Information
CHEN You-han,GUI Zhi-bo. An Improved QoS Unicast Routing Algorithm Based on Uncertain State Information[J]. JJournal of Nanjing University of Posts and Telecommunications, 2007, 27(3): 62-66
Authors:CHEN You-han  GUI Zhi-bo
Affiliation:College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
Abstract:Traditional QoS unicast routing Algorithm assumes that there exists precise state information in any node within IP networks, but in a practical network ,the state information is almost uncertain. In this paper, we design an improved QoS unicast routing algorithm based on uncertain information through dynamically determining the value of k in the k_shortest algorithm so as to select a better path than other algorithms. It can effectively decrease the packet loss rate and in crease the probability that the end-to-end delay constraint is met. The simulation results with NS have shown that the designed algorithm is effective.
Keywords:QoS routing   uncertain information    unicast   routing algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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