2023•IEEE Networking LettersRequires access

Twisted and Folded Clos-Network Design Model With Two-Step Blocking Probability Guarantee

Haruto Taka, Takeru Inoue, Eiji Oki

Open publisher page 14 citations

Abstract

A data center network often employs a Clos-network structure due to scalability nature. A previous design model analyzed blocking probability to guarantee the quality of Clos network. However, the conditions to guarantee the blocking probability in these models are stringent, which shrinks the switching capacity. This letter proposes a model that relaxes network design constraints to maximize switching capacity while guaranteeing blocking probability in a two-step manner, where the proposed model divides intermediate switches into two groups. Numerical results show that the proposed model achieves a larger switching capacity than a conventional one-step model.

About this research paper

What this paper is about

A data center network often employs a Clos-network structure due to scalability nature. A previous design model analyzed blocking probability to guarantee the quality of Clos network. However, the conditions to guarantee the blocking probability in these models are stringent, which shrinks the switching capacity. This letter proposes a model that relaxes network design constraints to maximize switching capacity while guaranteeing blocking probability in a two-step manner, where the proposed model divides intermediate switches into two groups. Numerical results show that the proposed model achieves a larger switching capacity than a conventional one-step model.

Why it matters

OpenAlex reports 14 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 data center network often employs a Clos-network structure due to scalability nature. A previous design model analyzed blocking probability to guarantee the quality of Clos network. However, the conditions to guarantee the blocking probability in these models are stringent, which shrinks the switching capacity. This letter proposes a model that relaxes network design constraints to maximize switching capacity while guaranteeing blocking probability in a two-step manner, where the proposed model divides intermediate switches into two groups. Numerical results show that the proposed model achieves a larger switching capacity than a conventional one-step model.

Key concepts: Clos network, Blocking (statistics), Computer science, Computer network

Related papers

Back to paper searchBrowse research topicsOriginal source
Twisted and Folded Clos-Network Design Model With Two-Step Blocking Probability Guarantee — Research Paper | ScholarLens