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

Abstract

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.

1. Introduction

We can observe that in recent years elastic optical networks (EONs) are becoming more popular as a potential alternative to the rapidly growing popularity of optical networks. An example of this is the significant shift of ICT services to the new form, instead of dedicated fixed services. Software as a service (SaaS), function as a service (FaaS), infrastructure as a service (IaaS), and platform as a service (PaaS) are demonstrations of this new form [1,2,3]. Common features of these services include availability on demand, great scalability, adaptability, and flexibility [4,5]. This approach is reflected in the progress of data-transmission technologies and networks. For decades, optical domain technologies have been widely utilized in access and core networks, including wavelength division multiplexing (WDM), coarse WDM (CWDM), and dense WDM (DWDM). These technologies have significant limits in terms of scalability and flexibility. The International Telecommunication Union (ITU) has overcome the problem of defined fixed frequency grids by changing to a format that allows small sections of the optical spectrum to be selected and operated [6,7]. The concept of frequency slot units (FSUs) as an updated form of spectrum granularity was provided by this new bandwidth-allocation model. Aside from having a very small granularity (specified by [8] FSU is set to 12.5 GHz, 6.25 GHz, or smaller in width), this model has another feature. Any number of FSUs can be used in an optical connection, as long as the sum of the FSUs remains below the full spectrum and the FSUs are adjacent. In EONs, such a connection is a paradigm (known as the m-slot connection) [4,5,9,10]. A new switching fabric architecture is required for optical switching networks to create many different flexible paths that support a novel bandwidth-allocation model [4,5,9,11,12,13,14,15].

Basic information about the EON operation, including switch architectures and switching fabric functions, can be found in [16,17]. The problem of routing and spectrum allocation in EONs at the network level is surveyed in [18], while the spectrum fragmentation problems and management approaches were treated in [19]. In [20], the authors evaluated the performance of EONs when spectrum conversion is introduced in intermediate switches. The nonblocking two-stage switching fabrics with multirate connections and conversion in both stages were considered in [21,22]. The authors of [23] present the simulation studies of elastic optical switching fabrics based on the three-stage Clos switching fabric. They evaluated the loss probability for various traffic classes offered in a single optical network node. The multicast connections and wide-sense nonblocking conditions in optical WDM networks are considered in [24]. Finally, elastic optical switches are also considered for use in data center networks, where various architectures and nonblocking conditions were considered in [25,26,27].

In many papers that discuss the nonblocking properties of switching fabrics, space–wavelength–space (SWS) and wavelength–space–wavelength (WSW) are the two identified architectures. 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. Two patterns are used to examine four node architectures employing waveband converters for EONs, according to allocation and distribution in [11]. In  [9], a switching node model is introduced that was found to meet the requirements of EONs as WSW switching fabrics. Similarly, the SWS1 and SWS2 architectures for flexible optical switching networks are described in [12]. The two WSW architectures (WSW1, WSW2) in [13], are investigated due to the lower number of FSUs in the interstage links, which can be provided by using more than one switch in the center stage (WSW2s). In [15], the authors considered the WSW1 switching fabric with 2, 3 and more input/output links and proposed seven routing algorithms.

In this paper, we define and illustrate the operation of six routing algorithms and derive sufficient conditions under which the proposed algorithms always end with success. The analysis shows that only three of the six algorithms are necessary for further study, and the required number of frequency slots in the interstage link can be smaller than that required in [15]. The construction cost, which is determined by the wavelength converters number, reflects this. As a result, the cost of building the switching nodes by using our proposed algorithm is less than the cost of constructing the switching nodes by using some of the previously published algorithms. Consequently, our algorithm succeeds if, for $r=4$, each interstage link contains only $n+\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$ FSUs, while it requires $2n$ FSUs, in [15]. In the case of switching fabrics with $r=4$, it means that the proposed work is new and improved. A demonstration of the general formula and a detailed analysis of the proposed algorithm are included in the subsequent sections of the paper.

2. Rearrangeable Switching Fabric Architecture and Operation

2.1. Switching Fabric Architecture

In this work, we consider the $\mathrm{WSW}1(n,r,k)$ switching fabric architecture with $r=4$ (see Figure 1) that consists of three stages. The first and last stages comprise r Bandwidth-Variable Wavelength-Converting Switch (BV-WBCSs), represented as ${\mathrm{I}}_i$ and ${\mathrm{O}}_j$ (where $1⩽i, j⩽r$), respectively. Only one Bandwidth-Variable Wavelength-Selective Space Switch (BV-WSSS) with r inputs and r outputs constitutes the center stage. There are r interstage links between every stage. $\mathrm{WSW}1(n,r,k)$ routes the $m\text{-}\mathrm{slot}$ connections, i.e., the connections that may use m subsequent FSUs (where one FSU represents 12.5 GHz of spectrum). BV-WBCS operates on $m\text{-}\mathrm{slot}$ connections and alters the spectrum of an $m\text{-}\mathrm{slot}$ connection from the spectrum of m FSUs at the input of BV-WBCS to another spectrum of m FSUs at the output.

The role of BV-WSSS is to switch an $m\text{-}\mathrm{slot}$ connection in the space domain without spectrum conversion capability. In [25], the internal structures of BV-WBCS and BV-WSSS are shown. The $\mathrm{WSW}1(r,n,k)$ inputs and outputs are numbered from 1 to r. In the same way, ${\mathrm{I}}_i$ and ${\mathrm{O}}_j$ are indexed. FSUs in the input fibers entering ${\mathrm{I}}_i$ and in the output fibers leaving ${\mathrm{O}}_j$ are numbered from 1 to n, while FSUs in the interstage links are numbered from 1 to k.

2.2. A New Connection Processing

The $\mathrm{WSW}1(r,n,k)$ switching fabric operates in two domains: space and frequency. Let us assume that $\mathrm{WSW}1(r,n,k)$ is nonblocking in the space domain, where BV-WSSS is a nonblocking switching fabric. Taking into account the state of the switching fabric shown in Figure 1, it should be noted that all $m\text{-}\mathrm{slot}$ connections that exist at the input of each ${\mathrm{I}}_i$ are marked by the same pattern, while $m\text{-}\mathrm{slot}$ connections that appear at the output of each ${\mathrm{O}}_j$ are distinguished by the same color. There is only one connection path between an input and an output of $\mathrm{WSW}1(r,n,k)$ there—a set of interstage links and a set of switching elements, such as ${\mathrm{I}}_i$, ${\mathrm{O}}_j$, and $\mathrm{BV}\text{-}\mathrm{WBSSS}$. With the exception of $\mathrm{BV}\text{-}\mathrm{WBSSS}$, all of these paths are disjoint, making $\mathrm{WSW}1(r,n,k)$ the nonblocking switching fabric in the space domain. However, if we consider the location of a particular $m\text{-}\mathrm{slot}$ connection in the frequency domain, we can locate connections that block each other. An m-slot connection from the input switch ${\mathrm{I}}_i$ that uses FSUs numbered x to $x+m-1$ to the output switch ${\mathrm{O}}_j$ with assigned slots y to $y+m-1$ is indicated by $({\mathrm{I}}_i\left[x\right],{\mathrm{O}}_j\left[y\right],m)$. When frequency slot indices are not important, we will use the notation $({\mathrm{I}}_i,{\mathrm{O}}_j,m)$; when we want to indicate only the switches that participate in a connection, we use the notation $({\mathrm{I}}_i,{\mathrm{O}}_j)$.

For example, the connection that demands slot 6 at input 1 blocks the connection that occupies slots 4–6 at input 3, since both connections are directed to ${\mathrm{O}}_2$ (i.e., they use the same slot in the link between $\mathrm{BV}\text{-}\mathrm{WBSSS}$ and ${\mathrm{O}}_2$). The red connections at inputs 1 and 2 (which occupy slots 7 and 8) are also connected to the same output switch ${\mathrm{O}}_4$, so they block each other. ${\mathrm{I}}_i$ and ${\mathrm{O}}_j$ eliminate the blocking situations in $\mathrm{WSW}1(r,n,k)$, i.e., connections in the blocking state are relocated to different frequency slots. We should mention that the operation of elastic optical networks imposes a connection $({\mathrm{I}}_i,{\mathrm{O}}_j)$, which must use adjacent FSUs. This operation is shown in Figure 1. ${\mathrm{I}}_i$ aggregates all connections from input i to output j in the links between ${\mathrm{I}}_i$ and $\mathrm{BV}\text{-}\mathrm{WBSSS}$ (and between $\mathrm{BV}\text{-}\mathrm{WBSSS}$ and ${\mathrm{O}}_j$) to the set of connections indicated as $h_{i,j}$. The function of ${\mathrm{O}}_j$ is to move connections that correspond to a specific $h_{i,j}$ to the requested position at the output of $\mathrm{WSW}1(r,n,k)$.

In this work, we employ the simultaneous connection model, that is, a model in which requests arrive at the input of the system at the same time and a set of compatible connections is set up simultaneously. Two connections are compatible if they use disjoint sets of FSUs in the input and/or output links. For example, the connections $({\mathrm{I}}_1\left[1\right],{\mathrm{O}}_2\left[5\right],1)$ and $({\mathrm{I}}_3\left[4\right],{\mathrm{O}}_2\left[4\right],3)$ are not compatible, since they both request slot 5 at output port 2. We assume that all FSUs in the input and output links are occupied by connections; that is, we have the maximum set of compatible connections. Although such a situation in real systems is uncommon, we can study all connection permutations in our analysis by including dummy connections, i.e., connections that use all free FSUs in the input and output links.

3. Control Algorithms

3.1. State Matrix

Let the maximum set of compatible connections be represented by $\mathbb{C}$, and ${\mathbb{X}}_{i,j}$ be a set of all connections $({\mathrm{I}}_i,{\mathrm{O}}_j)$ in $\mathbb{C}$. In the considered switching fabric, the first and the last sections contain wavelength converters. This helps to simplify the analysis of the state of $\mathrm{WSW}1(r,n,k)$, since it is not necessary to analyze all the connections established in $\mathrm{WSW}1(r,n,k)$ but only the sum of the bandwidth units occupied between any pair (${\mathrm{I}}_i$, ${\mathrm{O}}_j$). That is, we need to find relationships between the elements of the Cartesian product ${\mathrm{I}}_i\times {\mathrm{O}}_j$, which can be easily represented in the form of a matrix $r\times r$. This matrix, denoted by ${\mathit{H}}^{r\times r}$, is defined in the following way [15],

$${\mathit{H}}^{r\times r}=\left[h_{i,j}\right],1⩽i,j⩽r,$$

(1)

where

$$h_{i,j}=\sum _{{\mathbb{X}}_{i,j}}m,{\mathbb{X}}_{i,j}\subseteq \mathbb{C},\mathrm{and}{\mathbb{X}}_{i,j}=\left\{({\mathrm{I}}_i\left[x\right],{\mathrm{O}}_i\left[y\right],m)\right\}.$$

(2)

According to (2), element $h_{i,j}$ represents the aggregated spectrum of all connections $({\mathrm{I}}_i,{\mathrm{O}}_j)$. The matrix property is as follows,

$${\sum }_{i=1}^r{h}_{i,j}={\sum }_{j=1}^r{h}_{i,j}=n,$$

(3)

i.e., in every individual input/output link, there are n FSUs. ${\mathit{H}}^{4\times 4}$ represents $\mathbb{C}$ for $\mathrm{WSW}1(4,n,k)$ switching fabrics, and

$${\mathit{H}}^{4\times 4}=\left[\begin{array}{cccc}{h}_{1,1}& h_{1,2}& h_{1,3}& h_{1,4}\\ h_{2,1}& h_{2,2}& h_{2,3}& h_{2,4}\\ h_{3,1}& h_{3,2}& h_{3,3}& h_{3,4}\\ h_{4,1}& h_{4,2}& h_{4,3}& h_{4,4}\end{array}\right].$$

(4)

In matrix (4), according to property (3), we have $h_{1,1}$ = n − ($h_{1,2}$ + $h_{1,3}$ + $h_{1,4}$) and $h_{1,1}$ = n − ($h_{2,1}$ + $h_{3,1}$ + $h_{4,1}$) and so on. This property of ${\mathit{H}}^{4\times 4}$ is later used in this paper to demonstrate the rearrangeable non-blocking (RNB) conditions of $\mathrm{WSW}1(r,n,k)$.

3.2. FSUs Assignment Algorithms for WSW1(4, n, r) Switching Fabrics

The objective of this section is to describe how FSUs should be assigned to the connections in the $\mathrm{WSW}1(4,n,k)$ switching fabrics. In a space-division switching fabric, a connection path, i.e., a set of resources used by a given connection, is composed of swithching elements (SEs) and interstage links (ILs) used by the connection. When two connections must use the same IL at the same time, one of these connections is blocked. In an EON switching fabric there is another dimension, wavelength. In this case, the connection path is determined not only by a set of SEs and ILs, but also by a set of FSUs on a given IL. To find two blocking connections, it is necessary to determine not only whether the connection paths of these two connections use the same IL(ILs), but also whether they use at least one common FSU.

The process of assigning FSUs to connection paths so that they do not block each other can be implemented in a way similar to that proposed in [15]. However, in the considered $\mathrm{WSW}1(4,n,k)$ switching fabric, the problem is much more complex, due to the larger number of inputs and outputs, resulting in a larger number of possible permutations. We propose six distinct FSUs assignment algorithms, denoted as $\mathrm{AD}1$, $\mathrm{AD}2$, $\mathrm{AD}3$, $\mathrm{AD}4$, $\mathrm{AD}5$, and $\mathrm{AD}6$. Then, we try to find the best one, or a group of them, for which the number k of required FSUs in ILs will be the lowest, yet allowing the realization of all possible sets of compatible connections [33].

The main idea of all proposed algorithms is to divide all FSUs in ILs into two subsets, in which we will establish connections corresponding to different $h_{i,j}$. Of course, the wavelength intervals of FSUs used for the connections represented by $h_{i,j}$ at the input port may be different from those assigned to these connections in ILs. The wavelength shift is the task of BV-WBCSs, from which the outermost sections are constructed. To determine the conditions under which all possible $\mathbb{C}$ can be realized in $\mathrm{WSW}1(r,n,k)$ (that is, it is RNB, as shown in [33]), we have to find the required value of k in each IL as the maximum value of the sum of the number of FSUs in both subsets.

To proceed with the description of the assignment algorithms, we have to add an important assumption about ${\mathit{H}}^{4\times 4}$. Each set of compatible connections in $\mathrm{WSW}1(4,n,k)$ is represented by a different state of the matrix ${\mathit{H}}^{4\times 4}$. We can reduce the number of states considered, assuming that $h_{1,1}$ is equal to or greater than the rest of the elements in ${\mathit{H}}^{4\times 4}$. Similarly, $h_{2,2}$ is equal to or greater than the other elements, except for those in row 1 and column 1 [34]. Finally, $h_{3,3}$ is equal to or greater than all the remaining elements in ${\mathit{H}}^{4\times 4}$ from rows 1 and 2 and elements from column 1 and 2. This property can be written as

$$\begin{array}{c}\hfill h_{l,l}⩾h_{i,j},\mathrm{where}i,j=l,l+1,\dots ,4.\end{array}$$

(5)

This assumption does not change the FSUs assignment process or the final result, but simplifies the explanation of the algorithms, their structure, and operation. If the criteria in (5) are not satisfied, the input and/or output stages, represented as rows and/or columns in the matrix ${\mathit{H}}^{4\times 4}$, should be modified by rearranging. For example, if the element $h_{i,j}$ is greater than $h_{1,1}$, ${\mathrm{I}}_1$ is replaced with ${\mathrm{I}}_i$ and ${\mathrm{O}}_1$ with ${\mathrm{O}}_j$, which makes $h_{i,j}$ become $h_{1,1}$.

To make it possible for each algorithm to assign FSUs to connections, we introduce the concept of subregions and critical pairs. The rows and columns of the matrix ${\mathit{H}}^{r\times r}$ represent the inputs and outputs of $\mathrm{WSW}1(r,n,k)$, respectively. Two elements located in the same row/column represent connections from/to the same input/output, and cannot occupy the same FSUs in ILs. Otherwise, the connections represented by one of these elements are blocked. For example, the connections represented by $h_{1,1}$ and $h_{2,2}$ may use the same set of FSUs since they come from and go to different outer stage switches. We call such elements “matched”. On the other hand, the connections represented by $h_{1,1}$ and $h_{2,1}$ have to use different FSUs, as they are directed to the same output switch, and we call them “mismatched”. Let us divide the elements of each row and each column into two pairs of elements, creating four groups of four elements each.

Definition 1. 

Let ${\mathit{H}}^{4\times 4}$ represent $\mathbb{C}$ in $\mathrm{WSW}1(4,n,k)$ switching fabric working under algorithm $\mathrm{ADx}$, where $\mathrm{x}=1,2,\dots ,6$. Each algorithm divides ${\mathit{H}}^{r\times r}$ into four disjoint subsets called quarters (denoted as $Q_j^{\mathrm{ADx}}$, where $j=1,2,3,4$). Each $Q_j^{\mathrm{ADx}}$ consists of four elements $h_{i,j}$, which form two pairs of matched elements.

The way each algorithm assigns elements $h_{i,j}$ to quarters is shown in Figure 2. In each assignment, we can find pairs of $Q_j^{\mathrm{ADx}}$’s that are not in the same columns or rows. We surround these pairs with the same type of line and the same color, and the corresponding connections can occupy the same set of FSUs in ILs (elements matched). In contrast, $Q_{\mathrm{x}}$’s surrounded by different line types always share the same rows or columns, i.e., they are mismatched (having to occupy disjoint sets of FSUs in ILs). For instance, in $\mathrm{AD}1$  the quarters $Q_1^{\mathrm{AD}1}$ and $Q_4^{\mathrm{AD}1}$ contain $h_{1,1}$, $h_{1,2}$, $h_{2,1}$, $h_{2,2}$ and $h_{3,3}$, $h_{3,4}$, $h_{4,3}$, and $h_{4,4}$, respectively; these quarters are matched. In $Q_1^{\mathrm{AD}1}$, elements $h_{1,1}$ and $h_{2,2}$, as well as $h_{1,2}$ and $h_{2,1}$, are matched, while $h_{1,1}$ and $h_{1,2}$, as well as $h_{2,1}$ and $h_{2,2}$, or $h_{1,1}$ and $h_{2,1}$, as well as $h_{1,2}$ and $h_{2,2}$, are mismatched. When assigning slots, there will be no conflict between connections when mismatched quarters use disjoint sets of FSUs. Such mismatched quarters will be called “subregions”.

Definition 2. 

Two mismatched quarters obtained in ${\mathit{H}}^{4\times 4}$ by the algorithm $\mathrm{ADx}$ are called subregions. The subregions are denoted as ADx.j, where $j=1,2,3,4$ and $\mathrm{x}=1,2,3,4,5,6$.

The divisions of ${\mathit{H}}^{4\times 4}$ elements into subregions for algorithms $\mathrm{AD}1$, $\mathrm{AD}2$, and $\mathrm{AD}6$ are shown in Figure 3. Each of the four rectangles surrounding the matrix ${\mathit{H}}^{4\times 4}$ consists of a quarter surrounded by a solid line and a quarter surrounded by a dashed line (see Figure 3). When we have subregions determined by $\mathrm{ADx}$, we have to divide the set of FSUs in ILs into two subsets, ${\mathbb{S}}_1(\mathrm{ADx},\mathbb{C})$ and ${\mathbb{S}}_2(\mathrm{ADx},\mathbb{C})$; slots in each subset will be used for connections represented in different quarters in subregions. As a result, the total number of FSUs in ILs for algorithm $\mathrm{ADx}$, denoted by $k^{4\times 4}(\mathrm{ADx},\mathbb{C})$ is determined by the sum of slots needed in ${\mathbb{S}}_1(\mathrm{ADx},\mathbb{C})$ and ${\mathbb{S}}_2(\mathrm{ADx},\mathbb{C})$, that is,

$$k^{4\times 4}(\mathrm{ADx},\mathbb{C})=|{\mathbb{S}}_1(\mathrm{ADx},\mathbb{C})|+|{\mathbb{S}}_2(\mathrm{ADx},\mathbb{C})|.$$

(6)

Any $\mathbb{C}$ can be realized by using $\mathrm{ADx}$ when we maximize (6) through all $\mathbb{C}$s, that is, when

$$k^{4\times 4}\left(\mathrm{ADx}\right)=\underset{\mathbb{C}}{max}\left\{k^{4\times 4}(\mathrm{ADx},\mathbb{C})\right\}=\underset{\mathbb{C}}{max}\left\{\right|{\mathbb{S}}_1(\mathrm{ADx},\mathbb{C})|+|{\mathbb{S}}_2(\mathrm{ADx},\mathbb{C})\left|\right\}.$$

(7)

The connections shown in Figure 1 are set by using $\mathrm{AD}1$, and the set of FSUs in each IL is divided into subsets ${\mathbb{S}}_1(\mathrm{AD}1,\mathbb{C})$ and ${\mathbb{S}}_2(\mathrm{AD}1,\mathbb{C})$ by bold vertical lines.

As we have ${\mathit{H}}^{4\times 4}$ divided into subregions, we will now show how the algorithms assign FSUs to connections. We discuss here only $\mathrm{AD}1$ to limit the length of the paper; the assignment procedure for the other algorithms can be easily derived by analogy. First, we consider the connections represented by elements in $Q_1^{\mathrm{AD}1}$ and $Q_4^{\mathrm{AD}1}$, and the FSUs assigned to these connections will form the set ${\mathbb{S}}_1(\mathrm{AD}1,\mathbb{C})$. The connections in $h_{1,1}$ and $h_{2,2}$ are matched, so they can use the same set of FSUs in ILs from ${\mathrm{I}}_1$ and ${\mathrm{I}}_2$ numbered from 1 to $max\{$$h_{1,1}$;$h_{2,2}$$\}=$$h_{1,1}$. Similarly, the connections in $h_{3,3}$ and $h_{4,4}$ are matched, so they can use the same set of FSUs in ILs from ${\mathrm{I}}_3$ and ${\mathrm{I}}_4$ and are numbered from 1 to $max\{$$h_{3,3}$;$h_{4,4}$$\}=$$h_{3,3}$. The connections in $h_{1,2}$ and $h_{2,1}$ are also matched, but are mismatched with connections in $h_{1,1}$ and $h_{2,2}$; therefore, they can use FSUs from $h_{1,1}$$+1$ to $h_{1,1}$+$h_{1,2}$ and from $h_{1,1}$$+1$ to $h_{1,1}$+$h_{2,1}$. The same approach can be used for the connections in $h_{3,4}$ and $h_{4,3}$—that is, they can use FSUs from $h_{3,3}$$+1$ to $h_{3,3}$+$h_{3,4}$ and from $h_{3,3}$$+1$ to $h_{3,3}$+$h_{4,3}$. As a result, we have already assigned a FSUs and $a=$$|{\mathbb{S}}_1(\mathrm{AD}1,\mathbb{C})|$$=max\{$$h_{1,1}$$+max\{$$h_{1,2}$; $h_{2,1}$$\};$$h_{3,3}$$+max\{$$h_{3,4}$; $h_{4,3}$$\left\}\right\}$; from property (3) $h_{1,1}⩾h_{2,2}$ and $h_{3,3}⩾h_{4,4}$. Next, we have to consider the connections represented by elements in $Q_2^{\mathrm{AD}1}$ and $Q_3^{\mathrm{AD}1}$, and the FSUs assigned to these connections will form the set ${\mathbb{S}}_2(\mathrm{AD}1,\mathbb{C})$. By analogy, this set will contain FSUs numbered from $a+1$ to $max\{b;c\}$; where $b=a+max\{$$h_{1,3}$; $h_{2,4}$} and $c=a+max\{$$h_{3,1}$; $h_{4,2}$}.

The $\mathrm{AD}1$ is listed as Algorithm 1, and the detailed assignment of FSUs is shown in

Table 1. Assignment of FSUs to connections by $\mathrm{AD}1$.

Algorithm $\mathbf{AD}1$
${\mathit{h}}_{\mathit{i},\mathit{j}}$	Index Numbers of Assigned FSUs		${\mathit{Q}}_{\mathit{j}}^{\mathrm{AD}1}$	Set
	From	To
$h_{1,1}$	1	$h_{1,1}$	$Q_1^{\mathrm{AD}1}$	${\mathbb{S}}_1(\mathrm{AD}1,\mathbb{C})$
$h_{2,2}$	1	$h_{2,2}$	$Q_1^{\mathrm{AD}1}$
$h_{1,2}$	$h_{1,1}$$+1$	$h_{1,1}$+$h_{1,2}$	$Q_1^{\mathrm{AD}1}$
$h_{2,1}$	$h_{1,1}$$+1$	$h_{1,1}$+$h_{2,1}$	$Q_1^{\mathrm{AD}1}$
$h_{3,3}$	1	$h_{3,3}$	$Q_4^{\mathrm{AD}1}$
$h_{4,4}$	1	$h_{4,4}$	$Q_4^{\mathrm{AD}1}$
$h_{3,4}$	$h_{3,3}$$+1$	$h_{3,3}$+$h_{3,4}$	$Q_4^{\mathrm{AD}1}$
$h_{4,3}$	$h_{3,3}$$+1$	$h_{3,3}$+$h_{4,3}$	$Q_4^{\mathrm{AD}1}$
$h_{1,3}$	$a+1$	$a+$$h_{1,3}$	$Q_2^{\mathrm{AD}1}$	${\mathbb{S}}_2(\mathrm{AD}1,\mathbb{C})$
$h_{2,4}$	$a+1$	$a+$$h_{2,4}$	$Q_2^{\mathrm{AD}1}$
$h_{1,4}$	$b+1$	$b+$$h_{1,4}$	$Q_2^{\mathrm{AD}1}$
$h_{2,3}$	$b+1$	$b+$$h_{2,3}$	$Q_2^{\mathrm{AD}1}$
$h_{3,1}$	$a+1$	$a+$$h_{3,1}$	$Q_3^{\mathrm{AD}1}$
$h_{4,2}$	$a+1$	$a+$$h_{4,2}$	$Q_3^{\mathrm{AD}1}$
$h_{3,2}$	$c+1$	$c+$$h_{3,2}$	$Q_3^{\mathrm{AD}1}$
$h_{4,1}$	$c+1$	$c+$$h_{4,1}$	$Q_3^{\mathrm{AD}1}$

$a = max\{$$h_{1,1}$$+max\{$$h_{1,2}$; $h_{2,1}$$\};$$h_{3,3}$$+max\{$$h_{3,4}$; $h_{4,3}$$\left\}\right\}$; $b = a + max\{$$h_{1,3}$; $h_{2,4}\}$; $c = a + max\{$$h_{3,1}$; $h_{4,2}\}$.

. Similar procedures and tables can be obtained for algorithms from $\mathrm{AD}2$ to $\mathrm{AD}6$ by comparing $Q_j^{\mathrm{ADx}}$ presented in Figure 2b–f with that obtained for $\mathrm{AD}1$ (Figure 2a), and by comparing how FSUs are assigned to elements of $Q_j^{\mathrm{AD}1}$ in Table 1.

Algorithm 1: ($\mathrm{AD}1$)

Data: $\mathbb{C}$ Result: FSUs assigned to connections in $\mathbb{C}$ 1  Create matrix ${\mathit{H}}^{4\times 4}$ 2  Assign FSUs to the connections according to Table 1

3.3. The Maximum Number of FSUs in the Algorithms

We now determine the maximum number of FSUsto be occupied by each pair of mismatched quarters; that is, we derive the maximum values for (7) for each algorithm. The number of FSUs required by each ${\mathbb{S}}_1(\mathrm{ADx},\mathbb{C})$ and each ${\mathbb{S}}_2(\mathrm{ADx},\mathbb{C})$ depends on the elements of ${\mathit{H}}^{4\times 4}$ surrounded by solid and dashed lines, respectively. Similarly, as in the description of the algorithms, we provide a detailed analysis for $\mathrm{AD}1$ and present the final equations for the remaining algorithms. From Table 1, we obtain

$$|{\mathbb{S}}_1(\mathrm{ADx},\mathbb{C})|=\underset{\mathbb{C}}{max}\{max\{h_{1,1};h_{2,2}\}+max\{h_{1,2};h_{2,1}\};max\{h_{3,3};h_{4,4}\}+max\{h_{3,4};h_{4,3}\}\}$$

(8)

and

$$|{\mathbb{S}}_2(\mathrm{ADx},\mathbb{C})|=\underset{\mathbb{C}}{max}\{max\{h_{1,3};h_{2,4}\}+max\{h_{2,3};h_{1,4}\};max\{h_{3,1};h_{4,2}\}+max\{h_{3,2};h_{4,1}\}\}.$$

(9)

In general, each element of each pair in (8) and (9) can be greater. Therefore, we must consider all the cases to determine the maximum needed value of k. When the first sums in (8) and (9) are greater, we choose the maximum between pairs ($h_{1,1}$;$h_{2,2}$), ($h_{1,2}$;$h_{2,1}$), ($h_{1,3}$;$h_{2,4}$), and ($h_{2,3}$;$h_{4,1}$). The elements in these pairs form the subregion AD1.1 (see Figure 3a). In the subregions ADx.1 and ADx.4, quarters are placed horizontally (H), while in ADx.2 and ADx.3, quarters are placed vertically (V). The elements with maximum values in the subregions can be located in four scenarios: HH, HV, VH, and VV (see Figure 4), while in each scenario we have four cases denoted by (a), (b), (c), and (d). These cases for scenario HH in AD1.1 are presented in Figure 5.

In the equations listed in Appendix A, we provide the results for the possible maximum values of Equation (7) for all the scenarios and cases for $\mathrm{AD}1$. When creating these formulas, we take into account the properties (3) and (5). Here we explain two cases. In the AD1.1 scenario HH and case (a) $h_{1,1}$, $h_{1,2}$, $h_{1,3}$, and $h_{1,4}$ are the maximum values. This means that ${\displaystyle \underset{\mathbb{C}}{max}}\left\{k^{4\times 4}(\mathrm{AD}1.1;\mathbb{C})\right\}=h_{1,1}+h_{1,2}+h_{1,3}+h_{1,4}$, and this sum is equal to n (3). In the same scenario, but in case (c), we have $|{\mathbb{S}}_1(\mathrm{ADx},\mathbb{C})|=h_{2,1}+h_{2,2}$ and $|{\mathbb{S}}_2(\mathrm{ADx},\mathbb{C})|=h_{1,3}+h_{1,4}$. The maximum value of $h_{2,1}+h_{2,2}$ can be n. However, since $h_{1,1}⩾h_{2,2}$ we get $h_{1,1}⩾\lceil \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rceil$ and $h_{2,2}⩽\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$ Since $h_{1,1}⩾\lceil \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rceil$, the maximum value of $h_{1,3}$ + $h_{1,4}$ = n − $h_{1,1}$, i.e., $h_{1,3}+h_{1,4}=\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$. As the result, $k^{4\times 4}(\mathrm{AD}1.1;\mathbb{C})$ = $n+\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$.

The listed equations give the maximum values of k for a given subregion, scenario, and case. Now, we have to find for which of these equations k reaches the highest value through all possible $\mathbb{C}$s, that is

$$k^{4\times 4}\left(\mathrm{AD}1\right)=\underset{\mathbb{C}}{max}\{k^{4\times 4}(\mathrm{AD}1.1;\mathbb{C});k^{4\times 4}(\mathrm{AD}1.2;\mathbb{C});k^{4\times 4}(\mathrm{AD}1.3;\mathbb{C});k^{4\times 4}(\mathrm{AD}1.4;\mathbb{C})\}.$$

(10)

When we look at

Table 2. $\mathrm{AD}1$ Algorithm scenarios comparison.

Subregions	Scenarios	Algorithm $\mathbf{AD}1$
		set(a)	set(b)	set(c)	set(d)
$\mathrm{AD}1$.1	HH	n	n+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n
	VV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	VH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
$\mathrm{AD}1$.2	HH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	VV	n	n+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n
	VH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
$\mathrm{AD}1$.3	HH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	VV	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n,2n-1$	n
	VH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n	n+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
$\mathrm{AD}1$.4	HH	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n,2n-1$	n
	VV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	VH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n	n+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
Subregions	Scenarios	Algorithm $\mathrm{AD}2$
		set(a)	set(b)	set(c)	set(d)
$\mathrm{AD}2$.1	HH	n	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n
	VV	n+$\lfloor \raisebox{1ex}{$3n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	VH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
$\mathrm{AD}2$.2	HH	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$
	VV	n	$2n$	$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n
	VH	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
$\mathrm{AD}2$.3	HH	$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$
	VV	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$	n
	VH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
$\mathrm{AD}2$.4	HH	n	$2n$	$\lfloor \raisebox{1ex}{$3n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n
	VV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	$2n$	n+$\lfloor \raisebox{1ex}{$3n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$
	VH	$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$
	HV	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$
Subregions	Scenarios	Algorithm $\mathrm{AD}3$
		set(a)	set(b)	set(c)	set(d)
$\mathrm{AD}6$.1	HH	n	$2n$	$\lfloor \raisebox{1ex}{$3n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n
	VV	$2n$	n+$\lfloor \raisebox{1ex}{$3n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$
	VH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	HV	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$
$\mathrm{AD}6$.2	HH	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$
	VV	n	$2n$	$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n
	VH	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
$\mathrm{AD}6$.3	HH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$
	VV	n	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n
	VH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$
$\mathrm{AD}6$.4	HH	n	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n
	VV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$3n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$	$2n$
	VH	$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$2n$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$

, where we included the results of all subregions, scenarios, and cases for algorithms $\mathrm{AD}1$, $\mathrm{AD}2$, and $\mathrm{AD}6$, we can conclude that n ≤ $k^{4\times 4}\left(\mathrm{AD}1\right)$ ≤ $2n$. This means that there are $\mathbb{C}$s for which we can realize all connections in less than $2n$ slots, but there are also cases where $\mathbb{C}$ requires $2n$ slots. However, when we need $2n$ slots for $\mathbb{C}$ in the algorithm $\mathrm{AD}1$, we may need less than $2n$ slots when using another algorithm, for example $\mathrm{AD}2$ or $\mathrm{AD}6$. The results of these algorithms are also included in Table 2. We omit $\mathrm{AD}3$ and $\mathrm{AD}5$, because the arrangement of elements in $\mathrm{AD}2$ is similar to the transpose of $\mathrm{AD}3$, and the arrangement of elements in $\mathrm{AD}6$ is similar to the transpose of $\mathrm{AD}5$; moreover, the results for these algorithms are exactly the same as for $\mathrm{AD}2$ and $\mathrm{AD}6$, respectively. The problem of finding the best value of k when all the algorithms are used is the subject of the next section.

4. The New Algorithm $\mathrm{AD}7$ and RNB Conditions

The results of allocating FSUs to connections by algorithms $\mathrm{AD}1$–$\mathrm{AD}6$ vary widely. The question is which algorithm should be used to minimize the number of required FSUs in ILs, yet make it possible to realize any $\mathbb{C}$. This minimum value of k makes the $\mathrm{WSW}1(4,n,k)$ rearrangeable and is given by the following formula:

$$\begin{array}{c}\hfill k_{\mathrm{RNB}}^{4\times 4}⩾\underset{\mathbb{C}}{max}\{min\{k^{4\times 4}(\mathrm{AD}1;\mathbb{C});k^{4\times 4}(\mathrm{AD}2;\mathbb{C});k^{4\times 4}(\mathrm{AD}3;\mathbb{C});k^{4\times 4}(\mathrm{AD}4;\mathbb{C});k^{4\times 4}(\mathrm{AD}5;\mathbb{C});k^{4\times 4}(\mathrm{AD}6;\mathbb{C})\}\}\end{array}.$$

(11)

As stated in the previous section, we have $k^{4\times 4}(\mathrm{AD}2;\mathbb{C})=k^{4\times 4}(\mathrm{AD}3;\mathbb{C})$ and $k^{4\times 4}(\mathrm{AD}5;\mathbb{C})=k^{4\times 4}(\mathrm{AD}6;\mathbb{C})$; therefore, we can exclude $\mathrm{AD}3$ and $\mathrm{AD}5$ from (11). When we compared the results for $\mathrm{AD}1$, $\mathrm{AD}2$, and $\mathrm{AD}6$ (see Table 2) with the results for $\mathrm{AD}4$, we concluded that for any $\mathbb{C}$ we had $min\{k^{4\times 4}(\mathrm{AD}1;\mathbb{C});k^{4\times 4}(\mathrm{AD}2;\mathbb{C});k^{4\times 4}(\mathrm{AD}6;\mathbb{C})\}⩽k^{4\times 4}(\mathrm{AD}4;\mathbb{C})$; therefore, we could also exclude $\mathrm{AD}4$ from (11). Consequently, we finally obtain

$$\begin{array}{c}\hfill k_{\mathrm{RNB}}^{4\times 4}=k^{4\times 4}\left(\mathrm{AD}7\right)=\underset{\mathbb{C}}{max}\{min\{k^{4\times 4}(\mathrm{AD}1;\mathbb{C});k^{4\times 4}(\mathrm{AD}2;\mathbb{C});k^{4\times 4}(\mathrm{AD}6;\mathbb{C})\}\},\end{array}$$

(12)

where $\mathrm{AD}7$ is given as Algorithm 2.

Algorithm 2: ($\mathrm{AD}7$)

We explain the idea of $\mathrm{AD}7$ performance by means of the example presented in Figure 6. This example shows two matrices ${\mathit{H}}^{4\times 4}$ representing connections in two switching fabrics, $\mathrm{WSW}1(4,4,k)$ and $\mathrm{WSW}1(4,5,k)$ (see Figure 6a,b). In Figure 6a, we have $n=4$ (n is even) and when we use $\mathrm{AD}1$ to assign FSUs, we need $k^{4\times 4}(\mathrm{AD}1,\mathbb{C})=2n=8$ slots. This maximum value is obtained for the subregion AD1.3, scenario VV, and case (c) (see Table 2) for which $k=h_{1,4}+h_{2,4}+h_{3,3}+h_{4,3}=2+2+2+2=8$. However, when we use $\mathrm{AD}2$ for the same subregion, scenario and case, we see that these connections can be realized by using only $k=h_{2,4}+h_{3,4}+h_{1,3}+h_{4,3}=2+0+0+2=4$ slots. For $\mathrm{AD}6$, we also have $k=h_{2,4}+h_{4,4}+h_{1,3}+h_{3,3}=2+0+0+2=4$ slots. However, this number of slots is not sufficient to realize connections in other the subregions by $\mathrm{AD}2$ or $\mathrm{AD}6$. Both algorithms need 6 FSUs for subregions AD2.2 and AD6.2. On the other hand, there may be other connection patterns, for which $\mathrm{AD}2$ and $\mathrm{AD}6$ need more FSUs. We see this in Table 2 since for AD2.3, VV scenario and case (c), the maximum number of required k is $2n$ but for AD6.3—only $n+\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$. Similarly, we can analyze Figure 6b, where we have $n=5$ (n is odd). For $\mathrm{AD}1$, we need $k=9$ FSUs, while $\mathrm{AD}2$ and $\mathrm{AD}6$ can fit connections in $k=5$ FSUs. The role of $\mathrm{AD}7$ is to determine, for a given $\mathbb{C}$, which of the algorithms $\mathrm{AD}1$, $\mathrm{AD}2$, or $\mathrm{AD}6$ requires the fewest number of FSUs in ILs, and to use this algorithm for assigning slots to connections.

The question now is what the minimum number of required FSUs in ILs is sufficient to ensure that $\mathrm{AD}7$ always ends with success for any $\mathbb{C}$. The answer to this question is given in the following theorem.

Theorem 1. 

The $\mathrm{WSW}1(4,n,k)$ switching fabric is RNB for m-slot connections, $1⩽m⩽n$, and when $n⩾4$ under the algorithm $\mathrm{AD}7$ if

$$k⩾k_{\mathrm{RNB}}^{4\times 4}=n+\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor .$$

(13)

Proof. 

In $\mathrm{AD}7$, for a given $\mathbb{C}$, we check for which of the algorithms $\mathrm{AD}1$, $\mathrm{AD}2$, or $\mathrm{AD}6$ we need the lowest number of FSUs. Then, these minimum values calculated for each $\mathbb{C}$ must be maximized (see (12)). We can find the better algorithm by calculating the number of FSUs for each algorithm in each subregion for each scenario and case. These values are shown in

Table 3. Algorithm $\mathrm{AD}7$ scenarios.

Algorithm		$\mathbf{AD}7$
Subregions	Scenarios	a	b	c	d
$\mathrm{AD}7$.1	HH	n	n+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	$\lfloor \raisebox{1ex}{$3n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n
	VV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$
	VH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$
$\mathrm{AD}7$.2	HH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$
	VV	n	n+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n
	VH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
$\mathrm{AD}7$.3	HH	$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	VV	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n
	VH	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
$\mathrm{AD}7$.4	HH	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	$\lfloor \raisebox{1ex}{$3n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n
	VV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	VH	$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$+$\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$
	HV	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rfloor$	n+$\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$

, which we obtained from Table 2. We see that the maximum value in this table is $n+\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$; therefore, this number of FSUs is sufficient to realize all possible compatible connection patterns. □

5. Comparisons and Numerical Results

Algorithm $\mathrm{AD}7$ gives the best results of all the algorithms proposed in this paper. Now, we compare this algorithm with the algorithms CA6 and CA7 proposed in [15]. We first consider the $\mathrm{WSW}1(4,n,k)$ switching fabric. The values of $k_{\mathrm{RNB}}^{4\times 4}$ are compared in

Table 4. Comparison of $k_{\mathrm{RNB}}^{4\times 4}$ presented in [15] and required by Theorem 1.

	${\mathit{k}}_{\mathbf{RNB}}^{4\times 4}$
n	CA6 [15]	CA7 [15]	$\mathbf{AD}7$	$\mathbf{AD}7$ to CA6 [15]	$\mathbf{AD}7$ to CA7 [15]
5	10	14	8	20%	42.857%
10	20	28	16	20%	42.857%
15	30	42	25	16.7%	40.476%
20	40	56	33	17.5%	41.071%
40	80	112	66	17.5%	41.071%
60	120	168	100	16.7%	40.476%
80	160	224	133	16.875%	40.625%
160	320	448	266	16.875%	40.625%
320	640	896	533	16.7%	40.513%

and plotted in Figure 7. As for the CA6, $\mathrm{AD}7$ allows reducing the number of FSUs in ILs by more than 16%. In case of CA7, this reduction is greater than 40%. For instance, when $n=160$ (a typical value for band C in optical fibers when frequency slot is 25 GHz wide), CA6 requires 320 FSUs, CA7—448 FSUs, while $\mathrm{AD}7$ finishes with success when there are only 266 FSUs in ILs. This is illustrated in Table 4 and Figure 7, where $k_{\mathrm{RNB}}^{r\times r}\left(\mathrm{C}\mathrm{A}6\right)=\lceil \raisebox{1ex}{$r$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rceil n$ and $k_{\mathrm{RNB}}^{r\times r}\left(\mathrm{C}\mathrm{A}7\right)=\lceil \raisebox{1ex}{$r$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rceil (n+\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$5$}\right.\rfloor )$ [15]. Those previously developed algorithms (CA6, CA7) are based on the analysis of $r=2$ and $r=3$; however, $\mathrm{AD}7$ is developed based on the analysis of $r=4$, which delivers the most optimal and efficient result represented by the lowest number of FSUs in ILs. In addition, both algorithms CA6 and CA7 are multiplied by the factor of $\lceil \raisebox{1ex}{$r$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rceil$, and $\lceil \raisebox{1ex}{$r$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rceil$, respectively, which results in multiplication by 2 in case of $r=4$. That would affect the overall result to be multiplied by a factor of 2, which eventually leads to an increase of the number of FSUs in ILs. Hence, $k_{\mathrm{RNB}}^{4\times 4}\left(\mathrm{C}\mathrm{A}6\right)=2n$ and $k_{\mathrm{RNB}}^{4\times 4}\left(\mathrm{C}\mathrm{A}7\right)=2(n+\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$5$}\right.\rfloor )$, which means that both algorithms give greater value than $k_{\mathrm{RNB}}^{4\times 4}\left(\mathrm{AD}7\right)=n+\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rfloor$. Therefore, we notice that $\mathrm{AD}7$, when applied for ${\mathit{H}}^{4\times 4}$, yields a better result than previously published algorithms. For instance, $k_{\mathrm{RNB}}^{4\times 4}\left(\mathrm{AD}7\right)$ = 8, where $k_{\mathrm{RNB}}^{4\times 4}\left(\mathrm{C}\mathrm{A}6\right)$ = 10 and $k_{\mathrm{RNB}}^{4\times 4}\left(\mathrm{C}\mathrm{A}7\right)$ = 14.

When $r>4$, we compare some results for $r=$ 8, 16 and 32 and selected values of n. FSUs are assigned to connections by dividing ${\mathit{H}}^{r\times r}$ into submatrices ${\mathit{H}}^{4\times 4}$, similar to what is proposed in [15], and by using $\mathrm{AD}7$ for each submatrix. The number of FSUs in ILs is calculated in this case by the following equation:

$$k_{\mathrm{RNB}}^{r\times r}\left(\mathrm{AD}8\right)⩾k^{r\times r}\left(\mathrm{AD}8\right)=\lceil \raisebox{1ex}{$r$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rceil \times k_{\mathrm{RNB}}^{4\times 4}\left(\mathrm{AD}7\right).$$

(14)

The results are compared in

Table 5. Comparison of $k_{\mathrm{RNB}}^{r\times r}$ presented in [15] and required by Theorem 1.

n	$\mathit{r}=8$			$\mathit{r}=16$			$\mathit{r}=32$
	CA6	CA7	$\mathbf{AD}8$	CA6	CA7	$\mathbf{AD}8$	CA6	CA7	$\mathbf{AD}8$
20	80	84	66	160	168	132	320	308	264
40	160	168	132	320	336	264	640	616	528
60	240	252	200	480	504	400	960	924	800
80	320	336	266	640	672	532	1280	1232	1064
100	400	420	332	800	840	664	1600	1540	1328
120	480	504	400	960	1008	800	1920	1848	1600
140	560	588	466	1120	1176	932	2240	2156	1864
160	640	672	532	1280	1344	1064	2560	2464	2128
180	720	756	600	1440	1512	1200	2880	2772	2400
200	800	840	666	1600	1680	1332	3200	3080	2664
220	880	924	732	1760	1848	1464	3520	3388	2928
240	960	1008	800	1920	2016	1600	3840	3696	3200
260	1040	1092	866	2080	2184	1732	4160	4004	3464
280	1120	1176	932	2240	2352	1864	4480	4312	3728
300	1200	1260	1000	2400	2520	2000	4800	4620	4000
320	1280	1344	1066	2560	2688	2132	5120	4928	4264

with $k_{\mathrm{RNB}}^{r\times r}\left(\mathrm{C}\mathrm{A}6\right)$ and $k_{\mathrm{RNB}}^{r\times r}\left(\mathrm{C}\mathrm{A}7\right)$ [15], where $k_{\mathrm{RNB}}^{r\times r}\left(\mathrm{C}\mathrm{A}6\right)=\lceil \raisebox{1ex}{$r$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rceil n$ and $k_{\mathrm{RNB}}^{r\times r}\left(\mathrm{C}\mathrm{A}7\right)=\lceil \raisebox{1ex}{$r$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rceil (n+\lfloor \raisebox{1ex}{$2n$}\!\left/ \!\raisebox{-1ex}{$5$}\right.\rfloor )$. We can see that $\mathrm{AD}7$, when employed for $k_{\mathrm{RNB}}^{r\times r}$, outperforms all the algorithms published. For example, when $n=20$ we get $k_{\mathrm{RNB}}^{8\times 8}\left(\mathrm{C}\mathrm{A}6\right)=80$ and $k_{\mathrm{RNB}}^{8\times 8}\left(\mathrm{C}\mathrm{A}7\right)=84$, where $k_{\mathrm{RNB}}^{8\times 8}\left(\mathrm{AD}8\right)=66$. This shows how $\mathrm{AD}8$ yields better results when compared with other previously known algorithms.

In addition, as we illustrated previously, CA6 and CA7 are developed based on the analysis of ${\mathit{H}}^{2\times 2}$ and ${\mathit{H}}^{3\times 3}$, respectively, where $\mathrm{AD}7$ is developed based on the analysis of ${\mathit{H}}^{4\times 4}$. Therefore, when it comes to finding the number of FSUs in ILs, each algorithm is multiplied by a factor representing the value of r, i.e., algorithm CA6 is multiplied by a factor of $\lceil \raisebox{1ex}{$r$}\!\left/ \!\raisebox{-1ex}{$2$}\right.\rceil$, algorithm CA6 is multiplied by a factor of $\lceil \raisebox{1ex}{$r$}\!\left/ \!\raisebox{-1ex}{$3$}\right.\rceil$, and algorithm $\mathrm{AD}7$ is multiplied by a factor of $\lceil \raisebox{1ex}{$r$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rceil$ donated as $\mathrm{AD}8$. In case of $r=8$, the factor for CA6, CA7, and $\mathrm{AD}8$, respectively, will be (4, 3, and 2); similarly for $r=16$ the factor will be (8, 6, and 4), and finally, for $r=32$ the factor will be (16, 11, and 8). Accordingly, as r increases, the factor difference between algorithms increases, which can cause CA7 to have a lower number of FSUs in ILs than CA6 (see $r=32$ in Table 5).

We compared the proposed algorithm result with other results presented in [15]. We also investigated the results presented in [27] and found that they were not better than that presented in [15]. For instance, when $k_{\mathrm{RNB}}^{r\times r}\left(\mathrm{C}\mathrm{A}6\right)=20$, $k_{\mathrm{RNB}}^{r\times r}\left(\mathrm{C}\mathrm{A}7\right)=28$, and $k_{\mathrm{RNB}}^{r\times r}\left(\mathrm{A}\mathrm{D}7\right)=16$, the algorithms in [27] achieves $k_{\mathrm{SNB}}^{r\times r}=124$, and $k_{\mathrm{RNB}}^{r\times r}=40$. Furthermore, SNB derived in [13] requires even more FSUs than that presented in [15], as $k_{\mathrm{SNB}}^{8\times 8}=225$, where $k_{\mathrm{RNB}}^{8\times 8}\left(\mathrm{A}\mathrm{D}7\right)=132$. Similarly, the WNB proposed in [35] is not better than [15]. Therefore, it is sufficient to compare result for the proposed algorithms to the best-known result to date.

Finally, we should mention that the algorithm is very simple. The complexity of the algorithm is determined mainly by matrix preparation and rearranging such that the property (3) is fulfilled. When the matrix ${\mathit{H}}^{4\times 4}$ is given, $\mathrm{AD}7$ chooses the final algorithm to assign FSUs to connections in $\mathrm{O}\left(1\right)$ time, and then the selected algorithm assigns slots by using a fixed table. For $\mathrm{AD}1$ this assignment is given in Table 1.

6. Conclusions

In this paper, we proposed seven algorithms for assigning frequency slots to connections in $\mathrm{WSW}1(4,n,k)$ switching fabrics serving multislot connections. Algorithms $\mathrm{AD}1$ to $\mathrm{AD}6$ are based on matrix decomposition, while $\mathrm{AD}7$ uses all the algorithms mentioned before. For a given connection pattern, it uses those algorithms that require the fewest frequency slots. This approach was previously proposed in [15] but was limited to switching fabrics with $r=3$. When $r=4$, the number of slot assignment patterns increases rapidly, and many more cases must be analyzed to find the number of frequency slots, which ensures that the algorithms always end with success. The number that makes $\mathrm{WSW}1(4,n,k)$ rearrangeably nonblocking is given in Theorem 1. Algorithm $\mathrm{AD}7$ improves the previously known results by more than 16% or even 40%, depending on which algorithm is used. We also extrapolated the number of required frequency slots for $\mathrm{WSW}1(r,n,k)$ switching fabrics with $r>4$. In this case, the proposed algorithm also outperforms the previously known algorithms. It should be noted that the proposed solutions provide sufficient conditions for RNB. The necessity is not shown; this means that there is still place for other algorithms, which reduces the number of required frequency slots. However, we know that this number cannot be lower than $n+\lfloor \raisebox{1ex}{$n$}\!\left/ \!\raisebox{-1ex}{$4$}\right.\rfloor$ [15].

In this work, k is the only parameter we can use to obtain RNB conditions. When we have these conditions, we can consider how much power or how many elements the switching fabric needs. However, the number of tunable wavelength converters is rather determined by the switching fabric capacity and architecture (r switches in the input/output stages, one switch in the center stage). Therefore, k is more important since it determines the range of required converters. Moreover, the complexity of the algorithm is very low, since we have to calculate the result according to three simple algorithms from the algorithm $\mathrm{AD}8$ (12), as shown in (2), and use that with the lowest result. Then FSUs are assigned to connections by using the assignment given for each algorithm, such as in Table 1. The most time-consuming task is to prepare the matrix from the set of connections and sort it in such a way that conditions (3) and (5) are fulfilled.