The relative values of
m and
n define the blocking characteristics of the Clos network.
Strict-sense nonblocking Clos networks (m ≥ 2n−1): the original 1953 Clos result If
m ≥ 2
n−1, the Clos network is
strict-sense nonblocking, meaning that an unused input on an ingress switch can always be connected to an unused output on an egress switch,
without having to re-arrange existing calls. This is the result which formed the basis of Clos's classic 1953 paper. Assume that there is a free terminal on the input of an ingress switch, and this has to be connected to a free terminal on a particular egress switch. In the worst case,
n−1 other calls are active on the ingress switch in question, and
n−1 other calls are active on the egress switch in question. Assume, also in the worst case, that each of these calls passes through a different middle-stage switch. Hence in the worst case, 2
n−2 of the middle stage switches are unable to carry the new call. Therefore, to ensure strict-sense nonblocking operation, another middle stage switch is required, making a total of 2
n−1. The below diagram shows the worst case when the already established calls (blue and red) are passing different middle-stage switches, so another middle-stage switch is necessary to establish a call between the green input and output.
Rearrangeably nonblocking Clos networks (m ≥ n) If
m ≥
n, the Clos network is
rearrangeably nonblocking, meaning that an unused input on an ingress switch can always be connected to an unused output on an egress switch, but for this to take place, existing calls may have to be rearranged by assigning them to different centre stage switches in the Clos network. To prove this, it is sufficient to consider
m =
n, with the Clos network fully utilised; that is,
r×
n calls in progress. The proof shows how any permutation of these
r×
n input terminals onto
r×
n output terminals may be broken down into smaller permutations which may each be implemented by the individual crossbar switches in a Clos network with
m =
n. The proof uses
Hall's marriage theorem which is given this name because it is often explained as follows. Suppose there are
r boys and
r girls. The theorem states that if every subset of
k boys (for each
k such that 0 ≤
k ≤
r) between them know
k or more girls, then each boy can be paired off with a girl that he knows. It is obvious that this is a necessary condition for pairing to take place; what is surprising is that it is sufficient. In the context of a Clos network, each boy represents an ingress switch, and each girl represents an egress switch. A boy is said to know a girl if the corresponding ingress and egress switches carry the same call. Each set of
k boys must know at least
k girls because
k ingress switches are carrying
k×
n calls and these cannot be carried by less than
k egress switches. Hence each ingress switch can be paired off with an egress switch that carries the same call, via a one-to-one mapping. These
r calls can be carried by one middle-stage switch. If this middle-stage switch is now removed from the Clos network,
m is reduced by 1, and we are left with a smaller Clos network. The process then repeats itself until
m = 1, and every call is assigned to a middle-stage switch.
Blocking probabilities: the Lee and Jacobaeus approximations Real telephone switching systems are rarely strict-sense nonblocking for reasons of cost, and they have a small probability of blocking, which may be evaluated by the Lee or
Jacobaeus approximations, assuming no rearrangements of existing calls. Here, the potential number of other active calls on each ingress or egress switch is
u =
n−1. In the Lee approximation, it is assumed that each internal link between stages is already occupied by a call with a certain probability
p, and that this is completely independent between different links. This overestimates the blocking probability, particularly for small
r. The probability that a given internal link is busy is
p =
uq/
m, where
q is the probability that an ingress or egress link is busy. Conversely, the probability that a link is free is 1−
p. The probability that the path connecting an ingress switch to an egress switch via a particular middle stage switch is free is the probability that both links are free, (1−
p)2. Hence the probability of it being unavailable is 1−(1−
p)2 = 2
p−
p2. The probability of blocking, or the probability that no such path is free, is then [1−(1−
p)2]
m. The Jacobaeus approximation is more accurate, and to see how it is derived, assume that some particular mapping of calls entering the Clos network (input calls) already exists onto middle stage switches. This reflects the fact that only the
relative configurations of ingress switch and egress switches is of relevance. There are
i input calls entering via the same ingress switch as the free input terminal to be connected, and there are
j calls leaving the Clos network (output calls) via the same egress switch as the free output terminal to be connected. Hence 0 ≤
i ≤
u, and 0 ≤
j ≤
u. Let
A be the number of ways of assigning the
j output calls to the
m middle stage switches. Let
B be the number of these assignments which result in blocking. This is the number of cases in which the remaining
m−
j middle stage switches coincide with
m−
j of the
i input calls, which is the number of subsets containing
m−
j of these calls. Then the probability of blocking is: : \beta_{ij} = \frac{B}{A} = \frac {\left( \begin{array}{c} i \\ m-j \end{array} \right)} {\left( \begin{array}{c} m \\ j \end{array} \right)} = \frac{i!j!}{(i+j-m)!m!} If
fi is the probability that
i other calls are already active on the ingress switch, and
gj is the probability that
j other calls are already active on the egress switch, the overall blocking probability is: : P_B = \sum_{i=0}^{u}\sum_{j=0}^{u}f_ig_j\beta_{ij} This may be evaluated with
fi and
gj each being denoted by a
binomial distribution. After considerable algebraic manipulation, this may be written as: :P_B = \frac{(u!)^2(2-p)^{2u-m}p^m}{m!(2u-m)!} ==Clos networks with more than three stages==