Accelerating Non-Preemptive Multicast Flows in Reconfigurable Data Center Networks

DOI

抄録

The emerging reconfigurable circuit technology, which can establish circuit connections among switches, has been proposed as a promising paradigm for datacenter networks. This paper investigates how to accelerate the non-preemptive multicast flows in a demand-aware manner in reconfigurable datacenter networks. Firstly, the problem of scheduling the circuit switch to minimize the average completion time is introduced and proved to be NP-hard. A two-round matching algorithm is proposed to handle the conflicts between different multicast flows under the bandwidth constraint. The approximation ratio of the proposed algorithm is proved to be 2\sqrt{2n}, where n denotes the number of Top-of-Rack (ToR). Finally, we have demonstrated that the proposed algorithm can effectively reduce the average completion time of the flow compared to state-of-the-art algorithms through extensive simulations.

収録刊行物

  • IEICE Proceeding Series

    IEICE Proceeding Series 75 PS4-10-, 2023-09-06

    The Institute of Electronics, Information and Communication Engineers

詳細情報 詳細情報について

  • CRID
    1390579212415437184
  • DOI
    10.34385/proc.75.ps4-10
  • ISSN
    21885079
  • 本文言語コード
    en
  • データソース種別
    • JaLC
  • 抄録ライセンスフラグ
    使用不可

問題の指摘

ページトップへ