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

基于令牌桶的分级动态流量整形算法
引用本文:林南晖,索女中.基于令牌桶的分级动态流量整形算法[J].现代计算机,2011(12):7-9,24.
作者姓名:林南晖  索女中
作者单位:华南师范大学网络中心;华南师范大学计算机学院
基金项目:国家科技支撑计划子课题(No.2008BAH37B05084)
摘    要:区分服务和流量整形是保证实时应用和关键应用得到相应QoS的重要技术。提出基于二级令牌分配机制的流量整形结构,逐级设计令牌分配的具体算法。该算法使区分服务网络中优先级较高的数据流获得更多的出口带宽资源,同时根据输出需求动态调整同优先级数据流的带宽资源,兼顾优先和公平,提高企业网络出口有限带宽的使用效益。

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

Hierarchical and Dynamic Traffic Shaping Algorithm Based on Token Buckets
LIN Nan-hui,SUO Nv-zhong.Hierarchical and Dynamic Traffic Shaping Algorithm Based on Token Buckets[J].Modem Computer,2011(12):7-9,24.
Authors:LIN Nan-hui  SUO Nv-zhong
Affiliation:1.Network Center,South China Normal University,Guangzhou 510631; 2.School of Computer,South China Normal University,Guangzhou 510631)
Abstract: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.
Keywords:Traffic Shaping  Diff-Serv  Token Buckets  Dynamic Round Robin
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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