loading page

Transport Assistants to Enhance TCP Connections: Investigating the Placement Problem
  • +1
  • Jaime Galán-Jiménez,
  • Mohamed Faten Zhani,
  • José Gómez-delaHiz,
  • John Kaippallimalil
Jaime Galán-Jiménez
Universidad de Extremadura Escuela Politecnica

Corresponding Author:jaime@unex.es

Author Profile
Mohamed Faten Zhani
Universite de Sousse Institut Superieur d'Informatique et des Technologies de Communication de Hammam Sousse
Author Profile
José Gómez-delaHiz
Universidad de Extremadura Escuela Politecnica
Author Profile
John Kaippallimalil
Futurewei Technologies Inc
Author Profile

Abstract

As of today, 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 [1–3] 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, i.e., 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 optimal solutions obtained with the ILP but with lower execution time.
31 Jul 2024Submitted to International Journal of Network Management
01 Aug 2024Submission Checks Completed
01 Aug 2024Assigned to Editor
07 Aug 2024Review(s) Completed, Editorial Evaluation Pending
07 Aug 2024Reviewer(s) Assigned
30 Sep 2024Editorial Decision: Revise Minor
10 Oct 20241st Revision Received
28 Oct 2024Submission Checks Completed
28 Oct 2024Assigned to Editor
28 Oct 2024Review(s) Completed, Editorial Evaluation Pending
28 Oct 2024Reviewer(s) Assigned
03 Nov 2024Editorial Decision: Revise Minor
25 Nov 20242nd Revision Received
26 Nov 2024Submission Checks Completed
26 Nov 2024Assigned to Editor
26 Nov 2024Review(s) Completed, Editorial Evaluation Pending
26 Nov 2024Reviewer(s) Assigned