Design model of a three-stage folded Clos network with a decoupled first stage guaranteeing admissible blocking probability

被引:0
|
作者
Oki, Eiji [1 ]
Taniguchi, Ryotaro [1 ]
Anazawa, Kazuya [1 ,2 ]
Inoue, Takeru [2 ]
机构
[1] Kyoto Univ, Grad Sch Informat, Kyoto 6068501, Japan
[2] NTT Corp, NTT Network Innovat Labs, Yokohama, Kanagawa, Japan
关键词
Optical switches; Data centers; Optical transmitters; Scalability; Optical fiber communication; Switching circuits; Optical packet switching; Network architecture; Packet switching; Optical fiber networks; NONBLOCKING; SWITCHES;
D O I
10.1364/JOCN.550838
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Some data center networks have implemented optical circuit switching (OCS) to replace electrical packet switching, achieving reduced power consumption, lower latency, and increased capacity. This paper focuses on designing an OCS network to maximize the switching network size, defined as the number of terminals connected under the constraints of a fixed number of identical $N \times N$ switches and a specified maximum admissible blocking probability. An existing design for a three-stage folded Clos network encounters a limitation where the network size ceases to grow as the number of switches increases beyond a certain threshold. To address this, we propose a design model for a three-stage folded Clos network with the decoupled first stage, named 3dF, to maximize the network switching size while guaranteeing an admissible blocking probability. The 3dF model introduces an input-output layer that combines the first- and second-stage switches into a single, large switch and decouples the switching functions originally handled by a single switch at the first stage into two distinct switches. We formulate this model as an optimization problem and employ an exhaustive search-based algorithm to identify the structure with the largest switching network size in non-increasing order while ensuring that specified constraints, such as blocking probability, are satisfied. We derive theoretical results for three-stage folded Clos variants and, through numerical analysis, show that the 3dF design achieves a larger switching network size than other variants under the SNB condition or a blocking probability guarantee. (c) 2025 Optica Publishing Group.All rights, including for text and data mining (TDM), Artificial Intelligence (AI) training, and similar technologies, are reserved.
引用
收藏
页码:309 / 323
页数:15
相关论文
共 50 条
  • [1] Optical circuit switched three-stage twisted-folded Clos-network design model guaranteeing admissible blocking probability
    Taniguchi, Ryotaro
    Inoue, Takeru
    Anazawa, Kazuya
    Oki, Eiji
    JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 2024, 16 (11) : 1104 - 1115
  • [2] Design of Twisted and Folded-Clos Network With Guaranteeing Admissible Blocking Probability
    Taka, Haruto
    Inoue, Takeru
    Oki, Eiji
    IEEE Networking Letters, 2023, 5 (04): : 265 - 269
  • [3] Toward Increasing Switching Capacity of Twisted and Folded Clos Network Guaranteeing Admissible Blocking Probability
    Oki, Eiji
    Taka, Haruto
    Inoue, Takeru
    2024 24TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS, ICTON 2024, 2024,
  • [4] Design model of a twisted and folded Clos network with multi-step grouped intermediate switches guaranteeing admissible blocking probability
    Taka, Haruto
    Inoue, Takeru
    Oki, Eiji
    JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 2024, 16 (03) : 328 - 341
  • [5] A Unifying Approach to Determine the Blocking Probability for Four Models in the Multicast Three-stage Clos Network
    Yu Fan
    Gu Nai-jie
    Liu Yan-jun
    ISCSCT 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND COMPUTATIONAL TECHNOLOGY, VOL 1, PROCEEDINGS, 2008, : 339 - 342
  • [6] STUDY OF BLOCKING PROPERTIES OF THREE-STAGE CLOS NETWORKS.
    Kekre, H.B.
    Kumar, A.N.
    IETE Journal of Research, 1987, 33 (02) : 63 - 64
  • [7] Blocking probability of three-stage multicast switches
    Listanti, M
    Veltri, L
    ICC 98 - 1998 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS VOLS 1-3, 1998, : 623 - 629
  • [8] Middle stage requirements and blocking probability validation for three stage broadcasting Clos networks
    Ghaffar, A
    Devarajan, V
    1996 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - CONVERGING TECHNOLOGIES FOR TOMORROW'S APPLICATIONS, VOLS. 1-3, 1996, : 1050 - 1054
  • [9] Matching algorithms for three-stage bufferless Clos network switches
    Chao, HJ
    Jing, ZG
    Liew, SY
    IEEE COMMUNICATIONS MAGAZINE, 2003, 41 (10) : 46 - 54
  • [10] Multirate non-blocking generalized three-stage Clos switching networks
    Kabacinski, W
    Liotopoulos, FK
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (09) : 1486 - 1494