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

一种实现区分服务和带宽公平性的队列管理算法
引用本文:杨 洁,望育梅,雷振明.一种实现区分服务和带宽公平性的队列管理算法[J].北京邮电大学学报,2006,29(22):105-109.
作者姓名:杨 洁  望育梅  雷振明
作者单位:北京邮电大学 信息工程学院, 北京 100876
摘    要:区分服务(DiffServ)体系对于可靠型(AF)服务的OUT数据包和尽力型(BE)服务的数据包并未提供任何优先处理机制。为避免某AF服务的数据流占用过多的网络带宽,提出了一种名为TD&BF的核心无状态队列管理算法,该算法能在保证AF业务承诺服务速率的前提下,将剩余带宽公平地分配给BE业务及AF业务。

关 键 词:区分服务  可靠型  尽力型  承诺服务速率
收稿时间:2006-09-01

A Novel Queue Management Algorithm for Achieving Traffic Differentiation and Bandwidth Fairness
Affiliation:School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing 100876,China
Abstract:The differentiated service (DiffServ) architecture does not specify any scheme of priority between assured forwarding (AF) out-profile packets and best effort (BE) packets. In order to avoid misbehaving AF flows occupying excessive bandwidth, a simple core-stateless queue management scheme, named TD&BF, was proposed, which not only guarantees the committed rates of AF flows but also fairly allocates remained bandwidth between the BE and AF flows. Analysis and simulation results showed that the proposed scheme was highly effective and efficient.
Keywords:differentiated service  assured forwarding  best effort  committed rate
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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