摘要
传统的QoS保障的单播路由算法都假设IP网络结点的状态信息可以被准确地获知,但实际网络存在许多因素使得状态信息非精确。所设计的改进算法是通过动态确定k优路径算法(k_shor-test algorithm)中的k值,从而确保最终求得的路径相对其他算法所求得路径是更优的。因此能有效地降低了丢包率,提高了端到端延迟绑定的概率,通过网络仿真器NS的仿真分析,结果表明了该算法的有效性。
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.
出处
《南京邮电大学学报(自然科学版)》
2007年第3期62-66,共5页
Journal of Nanjing University of Posts and Telecommunications:Natural Science Edition
基金
江苏省高校自然科学基金(01KJB510001)
江苏省基础研究计划自然科学基金(BK2001124)资助项目
关键词
QOS路由
非精确状态
单播
路由算法
QoS routing
uncertain information
unicast
routing algorithm