«上一篇/Previous Article|本期目录/Table of Contents|下一篇/Next Article»

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:

期数:

2011年03期

页码:

128-131

栏目:

智能、算法、系统工程

出版日期:

1900-01-01

文章信息/Info

Title:

A Distributed QoS Routing Algorithm Based on Bandwidth and Delay Constraint

文章编号:

1673-629X（2011）03-0128-04

作者:

李勇

南京邮电大学计算机学院

Author(s):

LI Yong

School of Computer, Nanjing University of Posts ＆ Telecommunications

关键词:

QoS路由; 参数约束; 探测; 路由状态

Keywords:

QoS routing;  parameter constraints ;  probe ;  route state

分类号:

TP393

文献标志码:

A

摘要:

算法利用网络中每个节点的状态信息，通过选择探测的方法搜索满足业务带宽和时延约束要求的路由。算法分为路由探测和路由确认两个过程。在探测过程中，利用探测报文搜索可行的路由并在探测节点上重新计算带宽和时延参数，然后依据新参数继续探测符合约束要求的可行路由。当探测到路由请求的目的节点时，开始路由的确认过程。路由确认选取可行路由，利用确认报文进行路由确认，满足约束要求的节点进行资源预留，否则选取新路由进行确认。确认报文到达源节点时，表明路由建立成功，否则利用失败报文通告路由失败。仿真结果表明该算法能快速有效地建立路由

Abstract:

This algorithm depends on the local state of each node in the networks, searches routes that meet bandwidth and delay requirements through the selective probe method. It consists of two processes, routing detection and affirmation. In the routing detection process, it recalculates constraint parameters at each node, and then with the new parameters to probe feasible routes, which reduces the computational complexity of parameters. It will start affirmation process when the probe message reaches the destiny. In the routing affirmation process, it selects a feasible path meeting the constraint requirements and reserve resource in all nodes on the path. The routing successes when acknowledgement reaches the source node. The simulation results show that the proposed algorithm can establish a feasible route with high speed

备注/Memo

备注/Memo:

国家高技术研究发展计划“863”项151（2009AA01Z202）李勇（1981-）男，硕士研究生，研究方向为基于IP的下一代通信网络

常用功能

更新日期/Last Update: 1900-01-01