AMCA:一种基于主动的组播拥塞避免算法

M. Maimour, C. Pham
{"title":"AMCA:一种基于主动的组播拥塞避免算法","authors":"M. Maimour, C. Pham","doi":"10.1109/ISCC.2003.1214207","DOIUrl":null,"url":null,"abstract":"Many works have addressed the issue of congestion control for multicast communications and the problem is known to be highly complex. Scalability, responsiveness, stability and fairness with TCP are some of the required properties. In this paper, we present a congestion avoidance scheme for bulk data distribution called AMCA (active-based multicast congestion avoidance algorithm) that tries to meet these properties. We use the active networking technology to perform on a per-section dialogue to probe for available bandwidth along a multicast tree. The solution uses the RTT variations experienced by every branch to estimate the congestion situation in the multicast tree. The physical multicast tree is also used to appropriately aggregate the RTT variations at intermediate nodes before they reach the source. Simulations show that AMCA converges, makes use of the available bandwidth and reacts rapidly to dynamic changes while being TCP-fair.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"AMCA: an active-based multicast congestion avoidance algorithm\",\"authors\":\"M. Maimour, C. Pham\",\"doi\":\"10.1109/ISCC.2003.1214207\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many works have addressed the issue of congestion control for multicast communications and the problem is known to be highly complex. Scalability, responsiveness, stability and fairness with TCP are some of the required properties. In this paper, we present a congestion avoidance scheme for bulk data distribution called AMCA (active-based multicast congestion avoidance algorithm) that tries to meet these properties. We use the active networking technology to perform on a per-section dialogue to probe for available bandwidth along a multicast tree. The solution uses the RTT variations experienced by every branch to estimate the congestion situation in the multicast tree. The physical multicast tree is also used to appropriately aggregate the RTT variations at intermediate nodes before they reach the source. Simulations show that AMCA converges, makes use of the available bandwidth and reacts rapidly to dynamic changes while being TCP-fair.\",\"PeriodicalId\":356589,\"journal\":{\"name\":\"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC.2003.1214207\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2003.1214207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

许多工作已经解决了多播通信的拥塞控制问题,并且已知该问题非常复杂。TCP的可伸缩性、响应性、稳定性和公平性是一些必需的属性。在本文中,我们提出了一种用于批量数据分发的拥塞避免方案,称为AMCA(基于主动的多播拥塞避免算法),它试图满足这些属性。我们使用主动网络技术来执行每段对话,以探测沿多播树的可用带宽。该解决方案使用每个分支所经历的RTT变化来估计多播树中的拥塞情况。物理组播树还用于在RTT变化到达源之前在中间节点上适当地聚合它们。仿真结果表明,AMCA算法具有收敛性,充分利用了可用带宽,在保证tcp公平的同时对动态变化反应迅速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
AMCA: an active-based multicast congestion avoidance algorithm
Many works have addressed the issue of congestion control for multicast communications and the problem is known to be highly complex. Scalability, responsiveness, stability and fairness with TCP are some of the required properties. In this paper, we present a congestion avoidance scheme for bulk data distribution called AMCA (active-based multicast congestion avoidance algorithm) that tries to meet these properties. We use the active networking technology to perform on a per-section dialogue to probe for available bandwidth along a multicast tree. The solution uses the RTT variations experienced by every branch to estimate the congestion situation in the multicast tree. The physical multicast tree is also used to appropriately aggregate the RTT variations at intermediate nodes before they reach the source. Simulations show that AMCA converges, makes use of the available bandwidth and reacts rapidly to dynamic changes while being TCP-fair.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信