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 条
  • [1] Zero-wait load balancing with sparse messaging
    van der Boor, Mark
    Zubeldia, Martin
    Borst, Sem
    OPERATIONS RESEARCH LETTERS, 2020, 48 (03) : 368 - 375
  • [2] Multi-Round Influence Maximization
    Sun, Lichao
    Huang, Weiran
    Yu, Philip S.
    Chen, Wei
    KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, : 2249 - 2258
  • [3] The Multi-round Process Matrix
    Hoffreumon, Timothee
    Oreshkov, Ognyan
    QUANTUM, 2021, 5
  • [4] EFFICIENT OPTIMIZATION ALGORITHMS FOR ZERO-WAIT SCHEDULING OF MULTIPRODUCT BATCH PLANTS
    BIREWAR, DB
    GROSSMANN, IE
    INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 1989, 28 (09) : 1333 - 1345
  • [5] Is the Zero-Wait Policy Always Optimum for Information Freshness (Peak Age) or Throughput?
    Barakat, Basel
    Keates, Simeon
    Wassell, Ian
    Arshad, Kamran
    IEEE COMMUNICATIONS LETTERS, 2019, 23 (06) : 987 - 990
  • [6] Research on Zero-Wait Scheduling Problems in Multiproduct Processes with Due Dates
    Xu, Zhenhao
    Gu, Xingsheng
    INTELLIGENT COMPUTING FOR SUSTAINABLE ENERGY AND ENVIRONMENT, 2013, 355 : 322 - 332
  • [7] Multi-round anonymous auction protocols
    Kikuchi, H
    Hakavy, M
    Tygar, D
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1999, E82D (04): : 769 - 777
  • [8] On Multi-Round Privacy in Federated Learning
    Deer, August
    Ali, Ramy E.
    Avestimehr, A. Salman
    2022 56TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2022, : 764 - 769
  • [9] Multi-Round Recommendations for Stable Groups
    Heiska, Ilmo
    Stefanidis, Kostas
    PROCEEDINGS OF THE 2021 IEEE INTERNATIONAL CONFERENCE ON PROGRESS IN INFORMATICS AND COMPUTING (PIC), 2021, : 232 - 240
  • [10] ALGERIAN MULTI-ROUND DEMOGRAPHIC SURVEY
    NEGADI, G
    TABUTIN, D
    POPULATION, 1971, 26 (06): : 1135 - 1143