加强TCP连接的运输助手:调查安置问题

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Jaime Galán-Jiménez, Mohamed Faten Zhani, José Gómez-delaHiz, John Kaippallimalil
{"title":"加强TCP连接的运输助手:调查安置问题","authors":"Jaime Galán-Jiménez,&nbsp;Mohamed Faten Zhani,&nbsp;José Gómez-delaHiz,&nbsp;John Kaippallimalil","doi":"10.1002/nem.70006","DOIUrl":null,"url":null,"abstract":"<p>As of today, transport control protocol (TCP) remains the de-facto transport protocol in the Internet. However, TCP may incur high delays, especially when retransmitting lost packets as they have to be retransmitted only by the source and after a timeout that is roughly equal to a round trip time. To reduce such delay, recent work proposed to deploy a special network function, called transport assistant (TA), that is able to detect and retransmit lost TCP packets from inside the network rather than the source and thereby reduces retransmission delays. Unfortunately, there is no study on the impact of the placement of the TA on its performance benefits in terms of packet delivery delay. In this paper, we focus on the TA placement problem. We discuss the trade-offs and parameters to be considered to select the best placement for the TA. We first mathematically model the TCP packet delivery delay, that is, the time needed to deliver TCP packets, when the TA is deployed. We also formulate, as an integer linear program (ILP), the problem of placing multiple TAs in order to reduce TCP packet delivery delays while minimizing their deployment costs. We consider use-cases, one where a TA could handle a single flow and another where a TA could handle multiple flows. We then propose two heuristics to solve the problem with minimal execution time. Through experiments, we demonstrated that the deployment of TAs could reduce TCP packet delivery delays by up to 30% and could be leveraged to guide routing and load balancing. Moreover, we show that using the proposed heuristics for placing TAs could lead to performance that is close to the optimal solutions obtained with the ILP but with lower execution time.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 2","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.70006","citationCount":"0","resultStr":"{\"title\":\"Transport Assistants to Enhance TCP Connections: Investigating the Placement Problem\",\"authors\":\"Jaime Galán-Jiménez,&nbsp;Mohamed Faten Zhani,&nbsp;José Gómez-delaHiz,&nbsp;John Kaippallimalil\",\"doi\":\"10.1002/nem.70006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>As of today, transport control protocol (TCP) remains the de-facto transport protocol in the Internet. However, TCP may incur high delays, especially when retransmitting lost packets as they have to be retransmitted only by the source and after a timeout that is roughly equal to a round trip time. To reduce such delay, recent work proposed to deploy a special network function, called transport assistant (TA), that is able to detect and retransmit lost TCP packets from inside the network rather than the source and thereby reduces retransmission delays. Unfortunately, there is no study on the impact of the placement of the TA on its performance benefits in terms of packet delivery delay. In this paper, we focus on the TA placement problem. We discuss the trade-offs and parameters to be considered to select the best placement for the TA. We first mathematically model the TCP packet delivery delay, that is, the time needed to deliver TCP packets, when the TA is deployed. We also formulate, as an integer linear program (ILP), the problem of placing multiple TAs in order to reduce TCP packet delivery delays while minimizing their deployment costs. We consider use-cases, one where a TA could handle a single flow and another where a TA could handle multiple flows. We then propose two heuristics to solve the problem with minimal execution time. Through experiments, we demonstrated that the deployment of TAs could reduce TCP packet delivery delays by up to 30% and could be leveraged to guide routing and load balancing. Moreover, we show that using the proposed heuristics for placing TAs could lead to performance that is close to the optimal solutions obtained with the ILP but with lower execution time.</p>\",\"PeriodicalId\":14154,\"journal\":{\"name\":\"International Journal of Network Management\",\"volume\":\"35 2\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-02-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.70006\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Network Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/nem.70006\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Network Management","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/nem.70006","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

到目前为止,传输控制协议(TCP)仍然是Internet中事实上的传输协议。然而,TCP可能会导致高延迟,特别是在重传丢失的数据包时,因为它们必须仅由源重传,并且在大约等于往返时间的超时之后重传。为了减少这种延迟,最近的工作建议部署一种特殊的网络功能,称为传输助理(TA),它能够从网络内部而不是从源检测和重传丢失的TCP数据包,从而减少重传延迟。不幸的是,目前还没有研究TA的位置对其在数据包传递延迟方面的性能效益的影响。在本文中,我们主要研究助教的安置问题。我们讨论了为TA选择最佳位置时要考虑的权衡和参数。我们首先对TCP数据包的传输延迟进行数学建模,即在部署TA时传输TCP数据包所需的时间。我们也制定,作为一个整数线性规划(ILP),放置多个ta的问题,以减少TCP数据包的传递延迟,同时最小化他们的部署成本。我们考虑用例,其中一个是TA可以处理单个流,另一个是TA可以处理多个流。然后,我们提出了两种启发式方法,以最小的执行时间来解决问题。通过实验,我们证明了ta的部署可以将TCP数据包传递延迟减少多达30%,并可以用于指导路由和负载平衡。此外,我们表明,使用提出的启发式方法放置TAs可以导致性能接近用ILP获得的最优解,但执行时间更短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Transport Assistants to Enhance TCP Connections: Investigating the Placement Problem

Transport Assistants to Enhance TCP Connections: Investigating the Placement Problem

As of today, transport control protocol (TCP) remains the de-facto transport protocol in the Internet. However, TCP may incur high delays, especially when retransmitting lost packets as they have to be retransmitted only by the source and after a timeout that is roughly equal to a round trip time. To reduce such delay, recent work proposed to deploy a special network function, called transport assistant (TA), that is able to detect and retransmit lost TCP packets from inside the network rather than the source and thereby reduces retransmission delays. Unfortunately, there is no study on the impact of the placement of the TA on its performance benefits in terms of packet delivery delay. In this paper, we focus on the TA placement problem. We discuss the trade-offs and parameters to be considered to select the best placement for the TA. We first mathematically model the TCP packet delivery delay, that is, the time needed to deliver TCP packets, when the TA is deployed. We also formulate, as an integer linear program (ILP), the problem of placing multiple TAs in order to reduce TCP packet delivery delays while minimizing their deployment costs. We consider use-cases, one where a TA could handle a single flow and another where a TA could handle multiple flows. We then propose two heuristics to solve the problem with minimal execution time. Through experiments, we demonstrated that the deployment of TAs could reduce TCP packet delivery delays by up to 30% and could be leveraged to guide routing and load balancing. Moreover, we show that using the proposed heuristics for placing TAs could lead to performance that is close to the optimal solutions obtained with the ILP but with lower execution time.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Network Management
International Journal of Network Management COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
5.10
自引率
6.70%
发文量
25
审稿时长
>12 weeks
期刊介绍: Modern computer networks and communication systems are increasing in size, scope, and heterogeneity. The promise of a single end-to-end technology has not been realized and likely never will occur. The decreasing cost of bandwidth is increasing the possible applications of computer networks and communication systems to entirely new domains. Problems in integrating heterogeneous wired and wireless technologies, ensuring security and quality of service, and reliably operating large-scale systems including the inclusion of cloud computing have all emerged as important topics. The one constant is the need for network management. Challenges in network management have never been greater than they are today. The International Journal of Network Management is the forum for researchers, developers, and practitioners in network management to present their work to an international audience. The journal is dedicated to the dissemination of information, which will enable improved management, operation, and maintenance of computer networks and communication systems. The journal is peer reviewed and publishes original papers (both theoretical and experimental) by leading researchers, practitioners, and consultants from universities, research laboratories, and companies around the world. Issues with thematic or guest-edited special topics typically occur several times per year. Topic areas for the journal are largely defined by the taxonomy for network and service management developed by IFIP WG6.6, together with IEEE-CNOM, the IRTF-NMRG and the Emanics Network of Excellence.
×
引用
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学术官方微信