A new scalable reliable multicast transport protocol using perfect buffer management

A. Jantan, S.A. Hatem, A. Alsayh, S. Khatun, M. Rasid
{"title":"A new scalable reliable multicast transport protocol using perfect buffer management","authors":"A. Jantan, S.A. Hatem, A. Alsayh, S. Khatun, M. Rasid","doi":"10.1109/ICCCE.2008.4580796","DOIUrl":null,"url":null,"abstract":"Hierarchical reliable multicast transport protocols partition group members into local groups and allocate one local repair node for each local group to distribute the task of detecting and recovering lost packets. This repair node uses the data stored in its buffer to retransmit the requested packets to the requesting receivers. The problem is that they keep these packets for a long time until they get acknowledgments from all their children receivers of correctly receiving these packets. Keeping these packets creates a congestion problem which decreases the network throughput. This paper proposes a new scheme to solve this problem, by distributing the required packets between the repair node which we call it here the control receiver and some selected receives that have already received these packets correctly. The distribution of the packets decreases the number of packets in the repair node buffer, thus solve the congestion problem and increase the network throughput.","PeriodicalId":274652,"journal":{"name":"2008 International Conference on Computer and Communication Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Computer and Communication Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCE.2008.4580796","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Hierarchical reliable multicast transport protocols partition group members into local groups and allocate one local repair node for each local group to distribute the task of detecting and recovering lost packets. This repair node uses the data stored in its buffer to retransmit the requested packets to the requesting receivers. The problem is that they keep these packets for a long time until they get acknowledgments from all their children receivers of correctly receiving these packets. Keeping these packets creates a congestion problem which decreases the network throughput. This paper proposes a new scheme to solve this problem, by distributing the required packets between the repair node which we call it here the control receiver and some selected receives that have already received these packets correctly. The distribution of the packets decreases the number of packets in the repair node buffer, thus solve the congestion problem and increase the network throughput.
一个新的可扩展的可靠的多播传输协议,使用完美的缓冲区管理
分层可靠组播传输协议将组成员划分为本地组,并为每个本地组分配一个本地修复节点,以分配丢失报文的检测和恢复任务。此修复节点使用存储在其缓冲区中的数据将请求的数据包重新传输到请求的接收方。问题是,它们将这些数据包保存很长时间,直到它们从所有的子接收者那里得到正确接收这些数据包的确认。保留这些数据包会造成拥塞问题,从而降低网络吞吐量。本文提出了一种新的方案来解决这一问题,通过在修复节点(这里我们称之为控制接收器)和一些已经正确接收到这些数据包的选定接收器之间分配所需的数据包。数据包的分发减少了修复节点缓冲区中的数据包数量,从而解决了拥塞问题,提高了网络吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信