This paper considers the three-stage switching fabrics of wavelength-space-wavelength architecture, called WSW1 switching fabrics, for elastic optical nodes. Seven control algorithms for simultaneous connection routing are described. One algorithm is designed for the WSW1 switching fabric with 2 inputs and 2 outputs, four algorithms for the WSW1 switching fabric with 3 inputs and outputs, and two algorithms for nodes with a capacity greater than 3. We establish the necessary conditions for rearrangeability and prove sufficient rearrangeable conditions for the proposed algorithms. In cases where the switching fabric capacity is a multiple of 3, the sufficient conditions obtained for the proposed algorithms are the best known and close to the necessary conditions.
In this paper, we consider a two-stage converting-converting (CC) switching network. This structure can be used, for instance, in switches of elastic optical networks (EONs) or in time-division switches. We propose a new routing algorithm based on fixed slot assignment in interstage links. This algorithm, called Fixed Input–interstage Slot Assignment (FISA), reduces the switching network complexity compared to the rearrangeable (RNB) switching networks of the same structure. We derive the wide-sense nonblocking (WNB) conditions for the switching network controlled by this algorithm. The obtained WNB conditions are the same as those of the RNB, but the switching network does not need troublesome and time-consuming rearrangements. When implementing the proposed switching network structure, we can also reduce the number of tunable full-range spectrum converters and replace part of them with fixed spectrum converters, or even use space switches in the first stage. This is especially important when this architecture is applied in EONs.
3 September 2019 in Photonic Network Communications
In this study, we consider simultaneous connection routing in the three-stage switching fabric of the wavelength-space-wavelength architecture for elastic optical switches, which serve connections that can occupy different spectrum widths. Recently, the upper bound of the rearrangeability conditions was derived and proved for a switching fabric serving a limited number of connection rates. A control algorithm based on matrix decomposition was also proposed. In addition, the necessary and sufficient conditions were derived and proved for a switching fabric with a size of \(2 \times 2\) serving only two connection rates, but only when the ratios between the connection rates and link capacity are integers. In this study, we extend these results to an arbitrary ratio between the connection rates and link capacity. The number of frequency slot units required in the interstage links is much lower than that in the strict-sense nonblocking switching fabrics. We also propose modifications to the control algorithm, which further reduces the number of frequency slot units required in many cases. Finally, we extend the results for \(2 \times 2\) switching fabrics to those with a size of \(r \times r\).
1 January 2017 in Mathematical Problems in Engineering
This paper considers the nonblocking conditions for a multirate logd(N, 0, p) 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 d⌊(n − 1)/2⌋f0 ≥ f1 + 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 f0, f1, and d. In the continuous bandwidth model for B + b > 1, the results given in this paper are also the same as those by Hwang et al. (2005); however, for B + b ≤ 1, it was proved that a smaller number of vertically stacked logdN switching networks are needed.
1 January 2019 in Mathematical Problems in Engineering
The article discusses the strict‐sense nonblocking conditions derived for the log2N − 1 multirate switching fabric for the discrete bandwidth model at the connection level. Architecture of the log2N − 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 log2N − 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.