This paper presents novel six rearrangeable control algorithms suitable for Elastic Optical Network (EON). The proposed algorithms are based on simultaneous routing and matrix decomposition. We investigated the wavelength-space-wavelength switching fabrics, known as the WSW1, for previously developed three-stage architecture. In our proposal, we develop these algorithms for the four inputs/outputs WSW1 switching fabrics. The three-stage architecture of WSW1 was intensively considered only for a smaller number of inputs/outputs. We were able to achieve better results than previously proposed algorithms considering the same number of inputs/outputs. The switching fabric working under the proposed algorithms offers a smaller construction cost than the switching fabric controlled by previously known algorithms. This is expressed by the number of wavelength converters.

Four variants of the optical data center network architecture (DCN1 - DCN4) based on optical circuit switching and elastic optical switching elements are proposed. For each variant theoretical limits for non-blocking operation have been derived and proved. The proposed networks are also compared in terms of the required number of switching elements. Our results show that variant DCN1 is more appropriate for very small data centers with tens of racks with servers, while variant DCN4 requires much fewer switching elements in data centers with hundreds or thousands of such racks.

Changes in traffic characteristics impose new requirements on interconnection network in large data centers. These requirements force changes to be done in the network architecture and used technology. Traditional tree network topology is being replaced by Clos network, called also Leaf-Spine topology, and optical interconnection networks are added in parallel to conventional electronic switching networks. Circuit switching is also used in such network instead of packet switching. In this paper we analyze the three-stage Clos network in which three multiplexing schemes are used simultaneously on input, output, and interstage links and with circuit switching mode. Strict-sense nonblocking conditions for this network with three multiplexing levels (space, wavelength, and mode) are derived and proved. Up till now such network with at most two multiplexing levels (space and time, or space and wavelength) has been considered.

A new control algorithm for log2(N, 0, p) switching networks composed of 2 x 2 switching elements has been proposed recently. Under this algorithm, log2(N,0,p) switching networks with even number of stages are wide-sense nonblocking (WSNB) if p is the same as for the rearrangeable nonblocking (RNB) one. The considerred algorithm and WSNB conditions did not take into account crosstalk constraint, which is an important factor in photonic switching. This paper enhanced this algorithm to the case when crosstalk in the switching fabric is not allowed. WSNB conditions for this enhanced algorithm are also derived. It is shown, that the number of planes required is less than those derived earlier in other papers for WSNB multiplane banyan- type switching fabrics under crosstalk constraint. Under this algorithm, log2( N,0,p) switching networks with odd number of stages and with zero crosstalk are WSNB if p is the same as for RNB one.

A new control algorithm for log2(N, 0,p) switching networks composed of 2 × 2 switching elements has been proposed. Under this algorithm, log2(N, 0,p) switching networks with even number of stages are wide-sense nonblocking (WSNB) ifpis the same as for the rearrangeable nonblocking (RNB) one. In this paper we extend this solution to logd(N, 0,p) switching networks. The control algorithm is appropriately modified to switching networks composed ofd×dswitches. Wide-sense nonblocking operation of such switching networks with even number of stages is proved. We showed that number of planes needed for WSNB operation is also the same as in RNB switching networks.

A new control algorithm for multi-plane banyantype switching fabrics has been proposed recently. It has been shown that using this algorithm such switching fabrics can be wide-sense nonblocking (WSNB) when the number of planes is lower than for the strictly nonblocking (SNB) one, and for even number of stages the WSNB switching fabric requires the same number of planes as rearrangeable one. The considered algorithm and WSNB conditions did not take into account crosstalk constraint, which is an important factor in photonic switching. This paper enhanced this algorithm to the case when the first order crosstalk in the switching fabric is not allowed. WSNB conditions for this enhanced algorithm are also derived. It is shown that the number of planes required is less than those derived earlier in other papers for WSNB multiplane banyantype switching fabrics under crosstalk constraint.