A Novel Multipath QUIC Protocol with Minimized Flow Complete Time for Internet Content Distribution
Computer Science and Information Systems, Tome 21 (2024) no. 2.

Voir la notice de l'article provenant de la source Computer Science and Information Systems website

The rapid growth of network services and applications has led to an exponential increase in data flows on the internet. Given the dynamic nature of data traffic in the realm of internet content distribution, traditional TCP/IP network systems often struggle to guarantee reliable network resource utilization and management. The recent advancement of the Quick UDP Internet Connect (QUIC) protocol equips media transfer applications with essential features, including structured flowcontrolled streams, quick connection establishment, and seamless network path migration. These features are vital for ensuring the efficiency and reliability of network performance and resource utilization, especially when network hosts transmit data flows over end-to-end paths between two endpoints. QUIC greatly improves media transfer performance by reducing both connection setup time and transmission latency. However, it is still constrained by the limitations of single-path bandwidth capacity and its variability. To address this inherent limitation, recent research has delved into the concept of multipath QUIC, which utilizes multiple network paths to transmit data flows concurrently. The benefits of multipath QUIC are twofold: it boosts the overall bandwidth capacity and mitigates flow congestion issues that might plague individual paths. However, many previous studies have depended on basic scheduling policies, like round-robin or shortest-time-first, to distribute data transmission across multiple paths. These policies often overlook the subtle characteristics of network paths, leading to increased link congestion and transmission costs. In this paper, we introduce a novel multipath QUIC strategy aimed at minimizing flow completion time while taking into account both path delay and packet loss rate. Experimental results demonstrate the superiority of our proposed method compared to standard QUIC, Lowest-RTT-First (LRF) QUIC, and Pluginized QUIC schemes. The relative performance underscores the efficacy of our design in achieving efficient and reliable data transfer in real-world scenarios using the Mininet simulator.
Keywords: Quick UDP internet connect (QUIC), multipath transport, HTTP, content distribution, internet protocol, internet services
@article{CSIS_2024_21_2_a11,
     author = {Fang-Yi Lin and Wu-Min Sung and Lin Hui and Chih-Lin Hu and Nien-Tzu Hsieh and Yung-Hui Chen},
     title = {A {Novel} {Multipath} {QUIC} {Protocol} with {Minimized} {Flow} {Complete} {Time} for {Internet} {Content} {Distribution}},
     journal = {Computer Science and Information Systems},
     publisher = {mathdoc},
     volume = {21},
     number = {2},
     year = {2024},
     url = {http://geodesic.mathdoc.fr/item/CSIS_2024_21_2_a11/}
}
TY  - JOUR
AU  - Fang-Yi Lin
AU  - Wu-Min Sung
AU  - Lin Hui
AU  - Chih-Lin Hu
AU  - Nien-Tzu Hsieh
AU  - Yung-Hui Chen
TI  - A Novel Multipath QUIC Protocol with Minimized Flow Complete Time for Internet Content Distribution
JO  - Computer Science and Information Systems
PY  - 2024
VL  - 21
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CSIS_2024_21_2_a11/
ID  - CSIS_2024_21_2_a11
ER  - 
%0 Journal Article
%A Fang-Yi Lin
%A Wu-Min Sung
%A Lin Hui
%A Chih-Lin Hu
%A Nien-Tzu Hsieh
%A Yung-Hui Chen
%T A Novel Multipath QUIC Protocol with Minimized Flow Complete Time for Internet Content Distribution
%J Computer Science and Information Systems
%D 2024
%V 21
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CSIS_2024_21_2_a11/
%F CSIS_2024_21_2_a11
Fang-Yi Lin; Wu-Min Sung; Lin Hui; Chih-Lin Hu; Nien-Tzu Hsieh; Yung-Hui Chen. A Novel Multipath QUIC Protocol with Minimized Flow Complete Time for Internet Content Distribution. Computer Science and Information Systems, Tome 21 (2024) no. 2. http://geodesic.mathdoc.fr/item/CSIS_2024_21_2_a11/