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 条
  • [21] Interpersonal effects of emotion in a multi-round Trust Game
    Tortosa, Maria I.
    Strizhko, Tatiana
    Capizzi, Mariagrazia
    Ruz, Maria
    PSICOLOGICA, 2013, 34 (02): : 179 - 198
  • [22] Multi-Round Virus Filter Integrity Test Sensitivity
    Dowd, Christopher J.
    BIOTECHNOLOGY AND BIOENGINEERING, 2009, 103 (03) : 574 - 581
  • [23] A consensus mechanism based on multi-round concession negotiation
    Jiang, Yi
    Cheng, Xinyue
    Zhu, Junwu
    Xu, Yuntao
    COMPUTER STANDARDS & INTERFACES, 2021, 74
  • [24] A multi-round auction mechanism for parallel machine scheduling
    Zhu Q.
    Wang X.
    Geng S.
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2020, 40 (05): : 1242 - 1254
  • [25] Addressing the valuation problem in multi-round combinatorial auctions
    Chakraborty, Soumyakanti
    Sen, Anup K.
    Bagchi, Amitava
    INFORMATION SYSTEMS FRONTIERS, 2015, 17 (05) : 1145 - 1160
  • [26] Multi-Round Auction for Bandwidth Assignment in Relay Transmission
    Zhou, Wei
    Jing, Tao
    Huo, Yan
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2014, 3 (04) : 361 - 364
  • [27] Collection-aware multi-round scheduling algorithm
    Zhao, Ming-Yu
    Zhang, Tian-Wen
    Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology, 2008, 40 (05): : 745 - 749
  • [28] AntiCheetah: an Autonomic Multi-round Approach for Reliable Computing
    Di Pietro, Roberto
    Lombardi, Flavio
    Martinelli, Fabio
    Sgandurra, Daniele
    2013 IEEE 10TH INTERNATIONAL CONFERENCE ON AND 10TH INTERNATIONAL CONFERENCE ON AUTONOMIC AND TRUSTED COMPUTING (UIC/ATC) UBIQUITOUS INTELLIGENCE AND COMPUTING, 2013, : 371 - 379
  • [29] Multi-Round Contention in Wireless LANs with Multipacket Reception
    Zhang, Ying Jun
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2010, 9 (04) : 1503 - 1513
  • [30] Lossless Data Hiding with Multi-Round Difference Prediction
    Huang, Hsiang-Cheh
    Lin, Chuan-Chang
    Chen, Yueh-Hong
    Fang, Wai-Chi
    2014 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TW), 2014,