论文部分内容阅读
为了满足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 meet the requirements of transmission service quality for various network applications on the Internet, the Internet Engineering Task Force (IETF) has put forward the integrated service / resource reservation protocol (IntServ / RSVP) and the service model differentiated service (referred to as DiffServ), and multi protocol label switching (MPLS) proposed by the traffic engineering point of view, these service models all need a corresponding QoS routing mechanism and algorithm for different quality of service requests And allocate different routes.On the basis of studying all kinds of existing QoS routing algorithms, a classified minimum cost path first (CCPF) based on bandwidth is put forward.And by computer Simulation results show that the CCPF algorithm can effectively calculate and find the routes of different bandwidths with less time complexity and can use multiple service patterns as candidate routes.