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 条
  • [41] On Round Elimination for Special-Sound Multi-round Identification and the Generality of the Hypercube for MPCitH
    Hulsing, Andreas
    Joseph, David
    Majenz, Christian
    Narayanan, Anand Kumar
    ADVANCES IN CRYPTOLOGY - CRYPTO 2024, PT I, 2024, 14920 : 373 - 408
  • [42] Heuristics for multi-round divisible loads scheduling with limited memory
    Berlinska, J.
    Drozdowski, M.
    PARALLEL COMPUTING, 2010, 36 (04) : 199 - 211
  • [43] An algorithm of multi-round task scheduling in wireless sensor networks
    Dai, Liang
    Shen, Zhong
    Chang, Yilin
    Zhang, Ying
    Yan, Zhongjiang
    Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University, 2010, 44 (06): : 27 - 32
  • [44] THE MULTI-ROUND URBAN SURVEY OF INFANT AND CHILD-MORTALITY
    VANDEWALLE, E
    VANDEWALLE, F
    POPULATION INDEX, 1983, 49 (03) : 425 - 425
  • [45] Signals of value drive engagement with multi-round information interventions
    Lasky-Fink, Jessica
    Rogers, Todd
    PLOS ONE, 2022, 17 (10):
  • [46] Multi-Round Vote Elicitation for Manipulation under Candidate Uncertainty
    Ayadi, Manel
    Ben Amor, Nahla
    2015 IEEE 27TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2015), 2015, : 760 - 767
  • [47] Intelligent Hospital Guidance System based on Multi-Round Conversation
    Liu, Daowen
    Ma, Zhiyuan
    Zhou, Yangming
    Zhai, Jie
    Cai, Tingting
    Xue, Kui
    He, Ping
    2019 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2019, : 1540 - 1543
  • [48] Fiat-Shamir Transformation of Multi-round Interactive Proofs
    Attema, Thomas
    Fehr, Serge
    Klooss, Michael
    THEORY OF CRYPTOGRAPHY, TCC 2022, PT I, 2022, 13747 : 113 - 142
  • [49] The PI decision theory application of Multi-round Profile control
    Li, Zuochen
    PROGRESS IN ENVIRONMENTAL PROTECTION AND PROCESSING OF RESOURCE, PTS 1-4, 2013, 295-298 : 3302 - 3305
  • [50] Multi-round smoothed composite quantile regression for distributed data
    Di, Fengrui
    Wang, Lei
    ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 2022, 74 (05) : 869 - 893