The strictly non-blocking condition for three-stage networks

Collier, Martin; Curran, Thomas P.

doi:10.1016/b978-0-444-82031-0.50069-x

Cited by 7 publications

(3 citation statements)

References 13 publications

(9 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Different multirate switching networks were described in [9][10][11][12][13][14][15][16][17][18][19][20][21][22]. It should be noted that this type of switching networks has been considered in recent years as an interesting solution [23][24][25][26][27].…”

Section: Introductionmentioning

confidence: 99%

Strict‐Sense Nonblocking Conditions for the log₂⁡N − 1 Multirate Switching Fabric for the Discrete Bandwidth Model

Rajewski

2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The article discusses the strict-sense nonblocking conditions derived for the log2⁡N-1 multirate switching fabric for the discrete bandwidth model at the connection level. Architecture of the log2⁡N-1 switching fabric was described in previous study; however, conditions for the multirate discrete bandwidth model as well as comparison with different structures have not been published before. Both sufficient and necessary conditions were introduced and proved in this study. A few numerical examples which help to understand an idea of the multirate bandwidth model for the log2⁡N-1 switching fabrics were delivered as well. Additionally a comparison of achieved results to the banyan switching structures and a comparison of the costs of all mentioned in this study structures expressed as the number of optical elements were done.

show abstract

Section: Introductionmentioning

confidence: 99%

Strict‐Sense Nonblocking Conditions for the log₂⁡N − 1 Multirate Switching Fabric for the Discrete Bandwidth Model

Rajewski

2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…This upper bound was later improved by Chung and Ross in [7]. In turn, asymmetrical switch configurations were considered in [8]. More generalized 3-stage Clos switching fabrics were considered by Liotopoulos and Chalasani [9].…”

Section: Introductionmentioning

confidence: 99%

The Strict‐Sense Nonblocking Multirate log_d(N, 0, p) Switching Network

Kabacinski

Rajewski

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper considers the nonblocking conditions for a multirate log ( , 0, ) switching network at the connection level. The necessary and sufficient conditions for the discrete bandwidth model, as well as sufficient and, in particular cases, also necessary conditions for the continuous bandwidth model, were given. The results given for ⌊( −1)/2⌋ 0 ≥ 1 + 1 in the discrete bandwidth model are the same as those proposed by Hwang et al. (2005); however, in this paper, these results were extended to other values of 0 , 1 , and . In the continuous bandwidth model for + > 1, the results given in this paper are also the same as those by Hwang et al. (2005); however, for + ≤ 1, it was proved that a smaller number of vertically stacked log switching networks are needed.

show abstract

“…The use of three stages of switching to allow a large ATM switch to be constructed using smaller switch modules has received considerable attention [1][2][3][4][5][6][7]. A key consideration in the design of such switches is the routing algorithm used.…”

Section: Introductionmentioning

confidence: 99%

High-speed cell-level path allocation in a three-stage ATM switch

Collier

1994 IEEE GLOBECOM. Communications: The Global Bridge

View full text Add to dashboard Cite

Path allocation in a three-stage ATM switch is the process whereby bandwidth is reserved through the second stage of the switch for each cell. Cell-level path allocation, performed once in every time slot, ensures that cells are routed through the second stage of the switch without delay or contention. A new algorithm for cell-level path allocation was recently proposed by the author. The motive for supporting intermediate channel grouping in the algorithm is described here. The results of the path allocation process must be forwarded to the appropriate cells by a routing tag assignment network. A fast method of routing tag assignment is described, which employs a non-blocking copy network. This reduces the clock rate required of the circuitry, for a given switch size.

show abstract

The strictly non-blocking condition for three-stage networks

Cited by 7 publications

References 13 publications

Strict‐Sense Nonblocking Conditions for the log₂⁡N − 1 Multirate Switching Fabric for the Discrete Bandwidth Model

Strict‐Sense Nonblocking Conditions for the log₂⁡N − 1 Multirate Switching Fabric for the Discrete Bandwidth Model

The Strict‐Sense Nonblocking Multirate log_d(N, 0, p) Switching Network

High-speed cell-level path allocation in a three-stage ATM switch

Contact Info

Product

Resources

About

The strictly non-blocking condition for three-stage networks

Cited by 7 publications

References 13 publications

Strict‐Sense Nonblocking Conditions for the log2⁡N − 1 Multirate Switching Fabric for the Discrete Bandwidth Model

Strict‐Sense Nonblocking Conditions for the log2⁡N − 1 Multirate Switching Fabric for the Discrete Bandwidth Model

The Strict‐Sense Nonblocking Multirate logd(N, 0, p) Switching Network

High-speed cell-level path allocation in a three-stage ATM switch

Contact Info

Product

Resources

About

Strict‐Sense Nonblocking Conditions for the log₂⁡N − 1 Multirate Switching Fabric for the Discrete Bandwidth Model

Strict‐Sense Nonblocking Conditions for the log₂⁡N − 1 Multirate Switching Fabric for the Discrete Bandwidth Model

The Strict‐Sense Nonblocking Multirate log_d(N, 0, p) Switching Network