New upper bound for a rearrangeable non‐blocking WSW architecture

Lin, Bingkai

doi:10.1049/iet-com.2019.0242

Cited by 6 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are three stages in each architecture. One switch (SWS1/WSW1) or more than one switch (SWS2/WSW2) in the intermediate stage are the two categories of each architecture when classified in terms of the number of center-stage switches [ 12 , 13 , 14 , 15 , 25 , 28 , 29 , 30 , 31 , 32 ]. In the end, setting up a connection path by using the routing algorithm is one of the most important aspects.…”

Section: Introductionmentioning

confidence: 99%

Simultaneous Connections Routing in Wavelength–Space–Wavelength Elastic Optical Switches

Abuelela

Żal

Kabacinski

2023

Sensors

View full text Add to dashboard Cite

In this paper, we investigate the three-stage, wavelength–space–wavelength switching fabric architecture for nodes in elastic optical networks. In general, this switching fabric has r input and output switches with wavelength-converting capabilities and one center-stage space switch that does not change the spectrum used by a connection. This architecture is most commonly denoted by the WSW1 (r, n, k) switching network. We focus on this switching fabric serving simultaneous connection routing. Such routing takes place mostly in synchronous packet networks, where packets for switching arrive at the inputs of a switching network at the same time. Until now, only switching fabrics with up to three inputs and outputs have been extensively investigated. Routing in switching fabrics of greater capacity is estimated based on routing in switches with two or three inputs and outputs. We now improve the results for the switching fabrics with four inputs and outputs and use these results to estimate routing in the switching fabric with an arbitrary number of inputs and outputs. We propose six routing algorithms based on matrix decomposition for simultaneous connection routing. For the proposed routing algorithms, we derive criteria under which they always succeed. The proposed routing algorithms allow the construction of nonblocking switching fabrics with a lower number of wavelength converters and the reduction of the overall switching fabric cost.

show abstract