Skip to main content

Multistage switching and STS blocking

Short answer

Multistage switching builds large switches from smaller stages to save crosspoints. An STS switch has input and output time-multiplexed space stages connected to k centre TSIs; blocking probability PB = [1 - (1 - p')^2]^k with p' = pN/k, and is non-blocking when k ≥ 2N-1.

What is multistage switching? Describe the STS switching with neat diagram and its blocking probabilities.

Multistage switching

Multistage switching builds a large switch from two or more stages of smaller switching arrays joined by internal links. It needs far fewer crosspoints than a single N×NN \times N matrix and gives alternative paths, but some blocking may occur unless the middle stage is large enough (e.g. k≥2n−1k \ge 2n - 1).

STS switching

A Space–Time–Space switch has an input time-multiplexed space stage, a centre stage of kk TSIs, and an output space stage.

 Link 1 -->+-------+  [TSI 1]  +-------+--> Link 1
 Link 2 -->| N x k |->[TSI 2]->| k x N |--> Link 2
   ...     | space |   ...     | space |      ...
 Link N -->+-------+  [TSI k]  +-------+--> Link N
   c slots  (in S)   centre T   (out S)

Working: to connect slot ii of link 1 to slot jj of link N:

  1. The controller looks for a centre TSI mm that is free in input slot ii (link from input S) and in output slot jj (link to output S).
  2. In slot ii, the input space stage closes crosspoint (1, mm), sending the sample to TSI mm.
  3. TSI mm stores the sample and reads it out in slot jj.
  4. In slot jj, the output space stage closes crosspoint (mm, N), sending it to outgoing link N.
  5. The reverse direction is set up the same way.

There are kk alternative paths, one through each centre TSI.

Blocking probability

Using a Lee graph: each path has two internal links in series (input S → TSI and TSI → output S), and kk paths are in parallel.

  • External link occupancy: pp. With space expansion β=k/N\beta = k/N, internal link occupancy is p′=p/βp' = p/\beta.
  • Probability one path is free: (1−p′)2(1-p')^2; busy: 1−(1−p′)21-(1-p')^2.
  • Blocking (all kk busy):
PB=[1−(1−p′)2]kP_B = \left[1 - (1 - p')^2\right]^{k}
  • Non-blocking when k≥2N−1k \ge 2N - 1.

Example: N=k=16N = k = 16, p=0.7p = 0.7: p′=0.7p' = 0.7, PB=(1−0.09)16=0.9116≈0.22P_B = (1 - 0.09)^{16} = 0.91^{16} \approx 0.22.

Remark: to reduce blocking, kk must be raised, which adds TSIs and crosspoints (space expansion). For large switches, TST is cheaper for the same blocking, so STS is used mainly in small switches.

✓ Answer checked by Claude Opus 5.5 (high effort)

All Telecommunications chapter 4 questions →