主动拥塞控制机制的非累积分层组播

G. A. Ebrahim, A. Younis
{"title":"主动拥塞控制机制的非累积分层组播","authors":"G. A. Ebrahim, A. Younis","doi":"10.1109/AINA.2004.1283843","DOIUrl":null,"url":null,"abstract":"A new noncumulative layered multicast congestion control algorithm is proposed that can identify the location of congested branch(es) in the multicast tree and intelligently assign a dropping preference for each candidate layer. These preferences are assigned in a way that minimizes the number of affected receivers by dropping the corresponding layer. The algorithm assigns higher dropping preferences to the layers that cause simultaneous congestion in the multicast tree. It also minimizes the effect of receivers intentionally ignoring the congestion control algorithm, which provides tighter control of the receivers, and a bounded TCP-friendly behavior. Complexity analysis proves that the proposed algorithm has a linear computation time complexity. Simulation results show that the proposed congestion control algorithm in conjunction with a suitable layer coordination mechanism can increase the average normalized throughput of the receivers in the multicast session by more than 24%.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Active congestion control mechanism for non-cumulative layered multicasting\",\"authors\":\"G. A. Ebrahim, A. Younis\",\"doi\":\"10.1109/AINA.2004.1283843\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new noncumulative layered multicast congestion control algorithm is proposed that can identify the location of congested branch(es) in the multicast tree and intelligently assign a dropping preference for each candidate layer. These preferences are assigned in a way that minimizes the number of affected receivers by dropping the corresponding layer. The algorithm assigns higher dropping preferences to the layers that cause simultaneous congestion in the multicast tree. It also minimizes the effect of receivers intentionally ignoring the congestion control algorithm, which provides tighter control of the receivers, and a bounded TCP-friendly behavior. Complexity analysis proves that the proposed algorithm has a linear computation time complexity. Simulation results show that the proposed congestion control algorithm in conjunction with a suitable layer coordination mechanism can increase the average normalized throughput of the receivers in the multicast session by more than 24%.\",\"PeriodicalId\":186142,\"journal\":{\"name\":\"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.\",\"volume\":\"81 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2004.1283843\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2004.1283843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种新的非累积分层组播拥塞控制算法,该算法可以识别组播树中拥塞分支的位置,并为每个候选层智能地分配丢弃优先级。通过删除相应的层,以最小化受影响的接收器数量的方式分配这些首选项。该算法为引起多播树中同时拥塞的层分配更高的丢弃首选项。它还最大限度地减少了接收方故意忽略拥塞控制算法的影响,这为接收方提供了更严格的控制,并提供了有限的tcp友好行为。复杂度分析表明,该算法具有线性的计算时间复杂度。仿真结果表明,该拥塞控制算法结合合适的层协调机制,可使组播会话中接收端平均标准化吞吐量提高24%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Active congestion control mechanism for non-cumulative layered multicasting
A new noncumulative layered multicast congestion control algorithm is proposed that can identify the location of congested branch(es) in the multicast tree and intelligently assign a dropping preference for each candidate layer. These preferences are assigned in a way that minimizes the number of affected receivers by dropping the corresponding layer. The algorithm assigns higher dropping preferences to the layers that cause simultaneous congestion in the multicast tree. It also minimizes the effect of receivers intentionally ignoring the congestion control algorithm, which provides tighter control of the receivers, and a bounded TCP-friendly behavior. Complexity analysis proves that the proposed algorithm has a linear computation time complexity. Simulation results show that the proposed congestion control algorithm in conjunction with a suitable layer coordination mechanism can increase the average normalized throughput of the receivers in the multicast session by more than 24%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信