Explicit rate congestion control with binary notifications

A. C. Almeida, C. Belo
{"title":"Explicit rate congestion control with binary notifications","authors":"A. C. Almeida, C. Belo","doi":"10.1109/LANMAN.1999.939951","DOIUrl":null,"url":null,"abstract":"This paper presents a new rate-based source adaptation algorithm for packet-switching networks. The proposed scheme relies on binary notifications from the network to avoid congestion. The network nodes are supposed to estimate a fair share of source rate either based on a stored per-flow information or using a stateless approach. Binary notifications are sent to the sources, reflecting a positive or negative difference between the source rate and the estimated fair share at the nodes. Based on these notifications, sources increase/decrease the current rates using an adaptive algorithm that performs better than the classical additive increase multiplicative decrease strategy. In particular, oscillations on the source rates are much smaller, even with large network delays. Simulation results are presented both for ATM ABR and Internet environments.","PeriodicalId":122125,"journal":{"name":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LANMAN.1999.939951","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

This paper presents a new rate-based source adaptation algorithm for packet-switching networks. The proposed scheme relies on binary notifications from the network to avoid congestion. The network nodes are supposed to estimate a fair share of source rate either based on a stored per-flow information or using a stateless approach. Binary notifications are sent to the sources, reflecting a positive or negative difference between the source rate and the estimated fair share at the nodes. Based on these notifications, sources increase/decrease the current rates using an adaptive algorithm that performs better than the classical additive increase multiplicative decrease strategy. In particular, oscillations on the source rates are much smaller, even with large network delays. Simulation results are presented both for ATM ABR and Internet environments.
带有二进制通知的显式速率拥塞控制
提出了一种新的基于速率的分组交换网络源自适应算法。该方案依赖于来自网络的二进制通知来避免拥塞。网络节点应该基于存储的每流信息或使用无状态方法来估计源速率的公平份额。二进制通知被发送到源,反映源率与节点上估计的公平份额之间的正或负差异。基于这些通知,源使用自适应算法增加/减少当前速率,该算法比经典的加性增加乘性减少策略性能更好。特别是,源速率上的振荡要小得多,即使有很大的网络延迟。给出了ATM ABR和Internet环境下的仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信