一种分类预计算QoS路由算法

A Classified Pre-Computed QoS Routing Algorithm

为了满足Internet上各种网络应用的传输服务质量的需求,Internet工程任务组（IETF）先后提出了集成服务/资源预留模型（integrated service/resource reservation protocol,简称 IntServ/RSVP）、区分服务模型（differentiated service,简称DiffServ）以及从流量工程角度提出的多协议标记交换（multi protocol label switching,简称MPLS）.这些服务模型都需要一个与之相适应的QoS路由机制和算法,为不同的服务质量请求分配不同的路由.在研究各种现有的QoS路由算法的基础上,提出了一种以带宽为基本尺度的分类的最小代价路径优先算法（classified minimum cost path first,简称CCPF）.并通过计算机仿真,与其他相关算法进行了比较.结果证明,CCPF算法能在较小的时间复杂度内有效地计算并找出不同带宽区间的路由,可供多种服务模式作为候选路由使用.

In order to satisfy the quality of service (QoS) of the application on Internet, Internet engineering task force (IETF) has presented a set of network service mode such as IntServ/RSVP (Integrated Service/Resource Reservation Protocol), DiffServ (differentiated service) and MPLS (multi protocol label switching). All of these service modes need a correlative QoS routing mechanism and algorithm to assign an adapted route. Based on the research of existing routing algorithms, a new pre-computed QoS routing algorithm CCPF (classified minimum cost path first) is put forward, which uses bandwidth as a basic metric and gives a weighted cost function as a path optimal criterion. By simulation, this algorithm is compared with the others. The results show that it can get different routes among different bandwidth-ranges to support multiple service modes.