Path-Rank-Based Data Chunk Scheduling for Concurrent Multipath Transmission

Parul Tomar, Gyanendra Kumar, Lal Pratap Verma
{"title":"Path-Rank-Based Data Chunk Scheduling for Concurrent Multipath Transmission","authors":"Parul Tomar, Gyanendra Kumar, Lal Pratap Verma","doi":"10.1093/comjnl/bxac074","DOIUrl":null,"url":null,"abstract":"\n The device equipped with a multi-homing feature optimally exploits multiple network interfaces in modern communications networks such as the Internet of Things (IoT) and machine-to-machine communication using the concurrent multipath transfer (CMT). This enhances system performance by concurrently scheduling data chunks on multiple network paths. For a while, several scheduling criteria have been developed to optimize performance. However, it has been identified that CMT still suffers from many serious problems, such as spurious retransmission, receiver buffer blocking, improper congestion window (CWND) growth, re-ordering and long round trip time, resulting in poor performance. These problems occur due to the asymmetric nature of path characteristics. Thus, this paper introduces a path rank-based CMT (R-CMT) that schedules data chunks according to the rank of the path. The proposed scheduling method calculates the rank of each network path based on the ratio of successfully received and transmitted chunks. The simulation results indicate that the proposed R-CMT scheduling achieves higher performance in terms of network latency, throughput and CWND growth.","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"19 1","pages":"2254-2264"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"South Afr. Comput. J.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/comjnl/bxac074","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The device equipped with a multi-homing feature optimally exploits multiple network interfaces in modern communications networks such as the Internet of Things (IoT) and machine-to-machine communication using the concurrent multipath transfer (CMT). This enhances system performance by concurrently scheduling data chunks on multiple network paths. For a while, several scheduling criteria have been developed to optimize performance. However, it has been identified that CMT still suffers from many serious problems, such as spurious retransmission, receiver buffer blocking, improper congestion window (CWND) growth, re-ordering and long round trip time, resulting in poor performance. These problems occur due to the asymmetric nature of path characteristics. Thus, this paper introduces a path rank-based CMT (R-CMT) that schedules data chunks according to the rank of the path. The proposed scheduling method calculates the rank of each network path based on the ratio of successfully received and transmitted chunks. The simulation results indicate that the proposed R-CMT scheduling achieves higher performance in terms of network latency, throughput and CWND growth.
基于路径秩的多路径并发传输数据块调度
该设备配备了多归一功能,可以利用现代通信网络中的多个网络接口,例如物联网(IoT)和使用并发多路径传输(CMT)的机器对机器通信。这通过在多个网络路径上并发调度数据块来提高系统性能。一段时间以来,已经开发了几个调度标准来优化性能。然而,CMT仍然存在许多严重的问题,如虚假重传、接收端缓冲区阻塞、拥塞窗口(CWND)生长不当、重排序和往返时间长,导致性能不佳。这些问题的发生是由于路径特性的不对称性。因此,本文引入了一种基于路径秩的CMT (R-CMT),它根据路径的秩来调度数据块。提出的调度方法基于成功接收和发送的块的比率计算每个网络路径的秩。仿真结果表明,所提出的R-CMT调度在网络延迟、吞吐量和CWND增长方面具有较高的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信