基于令牌桶的分级动态流量整形算法  

Hierarchical and Dynamic Traffic Shaping Algorithm Based on Token Buckets

作　　者：林南晖[1] 索女中[2] 

机构地区：[1]华南师范大学网络中心,广州510631 [2]华南师范大学计算机学院,广州510631

出　　处：《现代计算机（中旬刊）》2011年第6期7-9,24,共4页Modern Computer

基　　金：国家科技支撑计划子课题(No.2008BAH37B05084)

摘　　要：区分服务和流量整形是保证实时应用和关键应用得到相应QoS的重要技术。提出基于二级令牌分配机制的流量整形结构,逐级设计令牌分配的具体算法。该算法使区分服务网络中优先级较高的数据流获得更多的出口带宽资源,同时根据输出需求动态调整同优先级数据流的带宽资源,兼顾优先和公平,提高企业网络出口有限带宽的使用效益。Differentiated services and traffic shaping are important techniques to guarantee QoS for realtime applications and key applications.Proposes an architecture for traffic shaping based on hierarchical token allocation mechanism,designs token allocation algorithms hierarchically.The algorithms make data flows which have higher priority to get more bandwidth resources in Diff-Serv network,they also dynamic adjust bandwidth resources among data flows with same priority according to the output demands,and achieves both priority and fairness,improves the bandwidth utilization rate for the enterprise network＇s outlet.

关 键 词：流量整形 区分服务 令牌桶 动态轮询 

分 类 号：TP393.11[自动化与计算机技术—计算机应用技术]