Buffer requirements for ABR traffic using congestion control mechanism

Ezzat S. Atieh, M. Matalgah, M. Guizani
{"title":"Buffer requirements for ABR traffic using congestion control mechanism","authors":"Ezzat S. Atieh, M. Matalgah, M. Guizani","doi":"10.1109/PCCC.1999.749446","DOIUrl":null,"url":null,"abstract":"In this paper, we perform analysis and simulation for the calculation of the minimum buffer size requirements for Available Bit Rate (ABR) traffic. We utilized a recently developed feedback flow control congestion mechanism. This mechanism belongs to a class of Backpressure (BP) algorithms. It ensures no data loss and operates based on simple \"stop\" and \"start\" signals. In our analysis, a feedback scheme on multiple ABR connections is used. Two buffering approaches are analyzed: (1) A Dedicated Approach; in which the flow control mechanism is applied independently for each of the connections. Thus, each connection is provided with its own buffer. (2) A Shared Approach; in which there will be some form of buffer sharing among the ABR connections. We studied the effects of changing the distance between nodes (connection length), number of connections, and the peak rate of each connection on buffer requirements using the two approaches.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1999.749446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we perform analysis and simulation for the calculation of the minimum buffer size requirements for Available Bit Rate (ABR) traffic. We utilized a recently developed feedback flow control congestion mechanism. This mechanism belongs to a class of Backpressure (BP) algorithms. It ensures no data loss and operates based on simple "stop" and "start" signals. In our analysis, a feedback scheme on multiple ABR connections is used. Two buffering approaches are analyzed: (1) A Dedicated Approach; in which the flow control mechanism is applied independently for each of the connections. Thus, each connection is provided with its own buffer. (2) A Shared Approach; in which there will be some form of buffer sharing among the ABR connections. We studied the effects of changing the distance between nodes (connection length), number of connections, and the peak rate of each connection on buffer requirements using the two approaches.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用拥塞控制机制的ABR流量的缓冲要求
在本文中,我们对可用比特率(ABR)流量的最小缓冲区大小要求的计算进行了分析和仿真。我们使用了最近开发的反馈流控制拥塞机制。该机制属于一类背压(BP)算法。它确保没有数据丢失,并基于简单的“停止”和“开始”信号进行操作。在我们的分析中,对多个ABR连接使用了反馈方案。分析了两种缓冲方法:(1)专用方法;其中,流量控制机制独立应用于每个连接。因此,每个连接都提供了自己的缓冲区。(2)共享方式;其中ABR连接之间会有某种形式的缓冲区共享。我们研究了使用这两种方法改变节点之间的距离(连接长度)、连接数和每个连接的峰值速率对缓冲区需求的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An optical layer protocol for lightpath management in WDM networks PDATS II: improved compression of address traces An adaptive distributed channel allocation strategy for mobile cellular networks Validation of Turandot, a fast processor model for microarchitecture exploration Sectored renaming for superscalar microprocessors
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1