EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

PBQ-Enhanced QUIC: QUIC with Deep Reinforcement Learning Congestion Control Mechanism

Zhifei Zhang iD, Shuo Li, Yiyang Ge, Ge Xiong, Yu Zhang, Ke Xiong iD

Entropy · 04.02.2023 · 25 (2) · 294

DOI: 10.3390/e25020294 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 04.02.2023. Verfasst von Zhifei Zhang und 5 weiteren Autor:innen. Beteiligte Einrichtung: Engineering Research Center of Network Management Technology for High Speed Railway of Ministry of Education, School of Computer and Information Tech…. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 29 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Fundamental Research Funds for the Central Universities, CAAI-Huawei MindSpore Open Fund Grant, CAAI-Huawei MindSpore Open Fund.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Currently, the most widely used protocol for the transportation layer of computer networks for reliable transportation is the Transmission Control Protocol (TCP). However, TCP has some problems such as high handshake delay, head-of-line (HOL) blocking, and so on. To solve these problems, Google proposed the Quick User Datagram Protocol Internet Connection (QUIC) protocol, which supports 0-1 round-trip time (RTT) handshake, a congestion control algorithm configuration in user mode. So far, the QUIC protocol has been integrated with traditional congestion control algorithms, which are not efficient in numerous scenarios. To solve this problem, we propose an efficient congestion control mechanism on the basis of deep reinforcement learning (DRL), i.e., proximal bandwidth-delay quick optimization (PBQ) for QUIC, which combines traditional bottleneck bandwidth and round-trip propagation time (BBR) with proximal policy optimization (PPO). In PBQ, the PPO agent outputs the congestion window (CWnd) and improves itself according to network state, and the BBR specifies the pacing rate of the client. Then, we apply the presented PBQ to QUIC and form a new version of QUIC, i.e., PBQ-enhanced QUIC. The experimental results show that the proposed PBQ-enhanced QUIC achieves much better performance in both throughput and RTT than existing popular versions of QUIC, such as QUIC with Cubic and QUIC with BBR.

Schlagwörter

Stichwörter der Autor:innen

BBRQUICcongestion controldeep reinforcement learning

Autor:innen und Institutionen

  • Engineering Research Center of Network Management Technology for High Speed Railway of Ministry of Education, School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China.
  • Collaborative Innovation Center of Railway Traffic Safety, Beijing Jiaotong University, Beijing 100044, China.
  • National Engineering Research Center of Advanced Network Technologies, Beijing Jiaotong University, Beijing 100044, China.
  • China Software and Technical Service Co., Ltd., Beijing 100081, China.
  • Institute of Economics and Energy Supply and Demand, State Grid Energy Research Institute Co., Ltd., Beijing 102209, China.

ORCID-Profile: Zhifei Zhang, Ke Xiong

Förderung

  • Fundamental Research Funds for the Central Universities
  • CAAI-Huawei MindSpore Open Fund Grant
  • CAAI-Huawei MindSpore Open Fund

Zitieren

APA

Zhang, Z., Li, S., Ge, Y., Xiong, G., Zhang, Y., & Xiong, K. (2023). PBQ-Enhanced QUIC: QUIC with Deep Reinforcement Learning Congestion Control Mechanism. Entropy, 25(2), 294. https://doi.org/10.3390/e25020294

Vancouver

Zhang Z, Li S, Ge Y, Xiong G, Zhang Y, Xiong K. PBQ-Enhanced QUIC: QUIC with Deep Reinforcement Learning Congestion Control Mechanism. Entropy. 2023;25(2):294. doi:10.3390/e25020294

BibTeX
@article{Zhang2023,
  author = {Zhang, Zhifei and Li, Shuo and Ge, Yiyang and Xiong, Ge and Zhang, Yu and Xiong, Ke},
  title = {PBQ-Enhanced QUIC: QUIC with Deep Reinforcement Learning Congestion Control Mechanism},
  journal = {Entropy},
  year = {2023},
  volume = {25},
  number = {2},
  pages = {294},
  doi = {10.3390/e25020294}
}
Kostenlos starten →