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

区分服务中AF类的一种调度算法
引用本文:刘金梅, 王思明. 区分服务中AF类的一种调度算法[J]. 电子与信息学报, 2003, 25(12): 1676-1681.
作者姓名:刘金梅  王思明
作者单位:暨南大学电子工程系,广州,510632
基金项目:“211工程”重点学科建设项目,“计算机信息与通信技术”资助课题
摘    要:该文根据区分服务中确保转发(Assured Forwarding,AF)类的特点,设计了一种新的调度算法公平加权轮循(Fair、Weighted Round Robin,FWRR)算法。 FWRR是一种基于轮循、工作保持型、适于变长分组的调度算法.它的实现简单,算法复杂度为O(1).仿真实验和数学分析表明,FWRR算法不仅能够提供保证最小带宽的服务,而且能够按比例分配剩余带宽,适合用来调度区分服务中的AF类.

关 键 词:区分服务   确保转发   公平加权轮循   调度算法
文章编号:1009-5896(2003)12-1676-06
收稿时间:2002-07-22
修稿时间:2002-07-22

A Scheduling Algorithm for Assured Forwarding Aggregated Flows of Differentiated Services
Liu Jin-mei, Wang Si-ming. A Scheduling Algorithm for Assured Forwarding Aggregated Flows of Differentiated Services[J]. Journal of Electronics & Information Technology, 2003, 25(12): 1676-1681.
Authors:Liu Jin-mei  Wang Si-ming
Affiliation:Dept. of Electronic Engineering Jinan University Guangzhou 510632 China
Abstract:According to the characteristics of Assured Forwarding (AF) aggregated flows of Differentiated Services(DiffServ), a new scheduling algorithm, named Fair Weighted Round Robin(FWRR) is proposed. FWRR is a work-conserving round robin scheduling algorithm for variable size packets. It has a very low implementation complexity of O(1). Simulation results and mathematic analyses show that FWRR can make each queue at least occupy a minimum reserved bandwidth and share some extra bandwidth proportionally. Therefore, FWRR is a suitable scheduling algorithm for the AF flows of DiffServ.
Keywords:Differentiated Services(DiffServ)   Assured Forwarding(AF)   Fair Weighted Round Robin(FWRR)   Scheduling algorithms  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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