A modified fair aggregate marking algorithm in DiffServ

Qinghua Xiao, Ling-di Ping, Xuezeng Pan
{"title":"A modified fair aggregate marking algorithm in DiffServ","authors":"Qinghua Xiao, Ling-di Ping, Xuezeng Pan","doi":"10.1109/WCICA.2004.1340889","DOIUrl":null,"url":null,"abstract":"With the emergence of network real time application, the need for quality of service (QoS) in the Internet has been given a rise. IETF has proposed a service model - DiffServ, which for its extensibility, has been widely accepted as a promising model. However, researchers found unfairness in DiffServ network. To solve this problem, this paper analyzed the inherent shortcomings of marker based on token bucket (TB) and time sliding window (TSW) in DiffServ, and proposed a new traffic rate estimator algorithm. This algorithm can tolerate the short-term burst of IP flows as well as reflecting the flows' temporal-behavior. Afterwards, a modified fair aggregate marking (MFAM) algorithm was presented based on the traffic rate estimator algorithm mentioned above. It contributes to fair sharing of excess bandwidth among aggregates. The author validated MFAM algorithm through simulation experimentation, and compared its performance with some other marking algorithms. The results show that MFAM algorithm has better fairness than others.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2004.1340889","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

With the emergence of network real time application, the need for quality of service (QoS) in the Internet has been given a rise. IETF has proposed a service model - DiffServ, which for its extensibility, has been widely accepted as a promising model. However, researchers found unfairness in DiffServ network. To solve this problem, this paper analyzed the inherent shortcomings of marker based on token bucket (TB) and time sliding window (TSW) in DiffServ, and proposed a new traffic rate estimator algorithm. This algorithm can tolerate the short-term burst of IP flows as well as reflecting the flows' temporal-behavior. Afterwards, a modified fair aggregate marking (MFAM) algorithm was presented based on the traffic rate estimator algorithm mentioned above. It contributes to fair sharing of excess bandwidth among aggregates. The author validated MFAM algorithm through simulation experimentation, and compared its performance with some other marking algorithms. The results show that MFAM algorithm has better fairness than others.
DiffServ中一种改进的公平聚合标记算法
随着网络实时应用的出现,对网络服务质量(QoS)的要求越来越高。IETF提出了一个服务模型——DiffServ,由于其可扩展性,它被广泛接受为一个有前途的模型。然而,研究人员发现DiffServ网络存在不公平现象。针对这一问题,分析了DiffServ中基于令牌桶(TB)和时间滑动窗口(TSW)标记的固有缺点,提出了一种新的流量估计算法。该算法既能容忍IP流的短期突发,又能反映IP流的时间行为。在此基础上,提出了一种改进的公平聚合标记(MFAM)算法。它有助于在聚合之间公平地共享多余的带宽。作者通过仿真实验对MFAM算法进行了验证,并将其性能与其他一些标记算法进行了比较。结果表明,MFAM算法具有较好的公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信