Mild: A Zero-Wait Multi-Round Proactive Transport

被引:0
|
作者
Pei, Renjie [1 ]
Li, Wenxin [1 ]
Li, Yulong [1 ]
Zhang, Song [1 ]
Li, Yaozhen [1 ]
Qu, Wenyu [1 ]
机构
[1] Tianjin Univ, Tianjin Key Lab Adv Networking, Tianjin, Peoples R China
关键词
Data Center Networks; Transport Protocols;
D O I
10.1109/ISCC61673.2024.10733697
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
With the rapid growth of datacenter network link speed, multi-round matching based proactive solutions (e.g., dcPIM) has become increasingly attractive. Such solutions enable receivers to obtain as much global information as possible through multi-round matching, thereby facilitating them to make near-optimal decisions on bandwidth allocation. However, the matching phase before transmitting data introduces significant latency overhead. In this paper, we present Mild, a zero-wait solution that runs a second sender-driven control loop in parallel, leveraging in-network telemetry (INT) to detect and fill the spare bandwidth during the matching phase. Furthermore, we introduce a selective dropping mechanism to ensure that the packets from the second loop do not impact the data transmission of the primary loop. Additionally, we use the well-protected primary loop to perform loss recovery for the dropped packets efficiently. We integrate Mild into a representative proposal dcPIM and evaluate its performance through 100Gbps large-scale simulations. Compared to the state-of-the-art solution, Mild reduces the tail flow completion time (FCT) of short flows by up to 55% while achieving up to 57%/45% lower average FCT of medium/large flows.
引用
收藏
页数:7
相关论文
共 50 条
  • [31] Multi-Round Sensor Deployment for Guaranteed Barrier Coverage
    Yang, Guanqun
    Qiao, Daji
    2010 PROCEEDINGS IEEE INFOCOM, 2010,
  • [32] Addressing the valuation problem in multi-round combinatorial auctions
    Soumyakanti Chakraborty
    Anup K. Sen
    Amitava Bagchi
    Information Systems Frontiers, 2015, 17 : 1145 - 1160
  • [33] Multi-round cooperative search games with multiple players
    Korman, Amos
    Rodeh, Yoav
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 113 : 125 - 149
  • [34] Multi-player and multi-round auctions with severely bounded communication
    Blumrosen, L
    Nisan, N
    Segal, I
    ALGORITHMS - ESA 2003, PROCEEDINGS, 2003, 2832 : 102 - 113
  • [35] The co-evolutionary immune clone algorithm and its application in zero-wait flowshop scheduling
    Jin F.
    Gu X.
    Gaojishu Tongxin/Chinese High Technology Letters, 2010, 20 (08): : 875 - 880
  • [36] Improved neural distinguishers with multi-round and multi-splicing construction
    Liu, JiaShuo
    Ren, JiongJiong
    Chen, ShaoZhen
    Li, ManMan
    JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2023, 74
  • [37] List-based threshold-accepting algorithm for zero-wait scheduling of multiproduct batch plants
    Lee, DS
    Vassiliadis, VS
    Park, JM
    INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2002, 41 (25) : 6579 - 6588
  • [38] Research on Genetic Algorithm and Nash Equilibrium in Multi-Round Procurement
    Bao Ngoc Trinh
    Quyet Thang Huynh
    Thuy Linh Nguyen
    NEW TRENDS IN INTELLIGENT SOFTWARE METHODOLOGIES, TOOLS AND TECHNIQUES, 2017, 297 : 51 - 64
  • [39] A Generic Transform from Multi-round Interactive Proof to NIZK
    Fouque, Pierre-Alain
    Georgescu, Adela
    Qian, Chen
    Roux-Langlois, Adeline
    Wen, Weiqiang
    PUBLIC-KEY CRYPTOGRAPHY - PKC 2023, PT II, 2023, 13941 : 461 - 481
  • [40] Strategies and evolution in the minority game: A multi-round strategy experiment
    Linde, Jona
    Sonnemans, Joep
    Tuinstra, Jan
    GAMES AND ECONOMIC BEHAVIOR, 2014, 86 : 77 - 95