2024•Journal of Optical Communications and NetworkingOpen access

Design model of a twisted and folded Clos network with multi-step grouped intermediate switches guaranteeing admissible blocking probability

Haruto Taka, Takeru Inoue, Eiji Oki

Open full text 20 citations

Abstract

A future data center network is expected to be constructed by a Clos network consisting of optical-circuit switches to deal with traffic growth. A previous model addressed a Clos-network design problem that divides the set of intermediate switches by each role for request routing to guarantee an admissible blocking probability to maximize the switching capacity. However, the previous model divides the set of intermediate switches into at most only two groups, and there is room for a more flexible design by increasing the number of divisions. This paper proposes a design model that generalizes the number of divisions to increase the switching capacity while guaranteeing an admissible blocking probability. We formulate the design model as an optimization problem. We introduce two algorithms to obtain a feasible solution that satisfies the constraints of the optimization problem. Numerical results showed that the proposed model can increase the switching capacity as the number of divisions increases.

Open-access reader

About this research paper

What this paper is about

A future data center network is expected to be constructed by a Clos network consisting of optical-circuit switches to deal with traffic growth. A previous model addressed a Clos-network design problem that divides the set of intermediate switches by each role for request routing to guarantee an admissible blocking probability to maximize the switching capacity. However, the previous model divides the set of intermediate switches into at most only two groups, and there is room for a more flexible design by increasing the number of divisions. This paper proposes a design model that generalizes the number of divisions to increase the switching capacity while guaranteeing an admissible blocking probability. We formulate the design model as an optimization problem. We introduce two algorithms to obtain a feasible solution that satisfies the constraints of the optimization problem. Numerical results showed that the proposed model can increase the switching capacity as the number of divisions increases.

Why it matters

OpenAlex reports 20 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A future data center network is expected to be constructed by a Clos network consisting of optical-circuit switches to deal with traffic growth. A previous model addressed a Clos-network design problem that divides the set of intermediate switches by each role for request routing to guarantee an admissible blocking probability to maximize the switching capacity. However, the previous model divides the set of intermediate switches into at most only two groups, and there is room for a more flexible design by increasing the number of divisions. This paper proposes a design model that generalizes the number of divisions to increase the switching capacity while guaranteeing an admissible blocking probability. We formulate the design model as an optimization problem. We introduce two algorithms to obtain a feasible solution that satisfies the constraints of the optimization problem. Numerical results showed that the proposed model can increase the switching capacity as the number of divisions increases.

Key concepts: Clos network, Blocking (statistics), Connection (principal bundle), Computer science, Parallel computing, Topology (electrical circuits), Distributed computing, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Design model of a twisted and folded Clos network with multi-step grouped intermediate switches guaranteeing admissible blocking probability — Research Paper | ScholarLens