Skip to main content

Derive STS and TST blocking probabilities

Short answer

Using Lee graphs, STS blocking probability is P_B = [1−(1−p')^2]^k, with p' = p/β and k centre TSIs; TST is P_B = [1−(1−p')^2]^l, with p' = p/α and l internal time slots. TST gives much lower blocking because l (typically 32–1024) far exceeds k, and raising l by faster memory is cheaper than adding hardware.

Derive expressions for the blocking probability of both STS and TST switches. Show that the blocking probability of a TST switch is lower than that of a STS switch.

Blocking probability of multistage switches is found with Lee graphs: each path is drawn as links in series, parallel paths are independent, and each link is busy with probability p′p'.

STS switch

NN incoming TDM links enter an N×kN \times k space stage, then kk centre-stage TSIs, then a k×Nk \times N space stage.

 A o---(k parallel paths, each = 2 links)---o B
        input S -> TSI_i -> output S
  • Each path uses two internal links in series: input S → TSI and TSI → output S.
  • If pp is the occupancy of external links, the internal link occupancy is
p′=pβ,β=kN (space expansion)p' = \frac{p}{\beta}, \quad \beta = \frac{k}{N} \text{ (space expansion)}
  • A path is free only if both links are free: probability (1−p′)2(1-p')^2. Path busy: 1−(1−p′)21-(1-p')^2.
  • There are kk parallel paths (one per centre TSI); the call is blocked only if all are busy:
PB,STS=[1−(1−p′)2]kP_{B,STS} = \left[1 - (1 - p')^2\right]^{k}

TST switch

NN incoming links, each with cc slots, go to input TSIs; a time-multiplexed space stage with ll internal time slots; then output TSIs.

  • The alternative paths are the ll internal time slots of the space stage. Each path uses two links: input TSI → S (in slot xx) and S → output TSI (in slot xx).
  • Internal link occupancy:
p′=pα,α=lc (time expansion)p' = \frac{p}{\alpha}, \quad \alpha = \frac{l}{c} \text{ (time expansion)}
  • Same Lee graph with ll parallel paths:
PB,TST=[1−(1−p′)2]lP_{B,TST} = \left[1 - (1 - p')^2\right]^{l}

Why TST has lower blocking

The expressions have the same form; the blocking depends on the number of parallel paths (the exponent) and p′p'.

  1. In STS the exponent is kk, the number of centre TSIs. Each extra path needs a whole TSI and adds crosspoints to both space stages (2Nk2Nk), so kk stays small.
  2. In TST the exponent is ll, the number of internal time slots. It is equal to or greater than the frame size cc (32 to 1024 in practice) and is raised just by running the space stage and memories faster, which is cheap.
  3. So for a practical size, l≫kl \gg k and the TST result is far smaller.

Example: p=0.7p = 0.7 E, no expansion (p′=0.7p' = 0.7), 1−(1−0.7)2=0.911-(1-0.7)^2 = 0.91:

  • STS with N=k=16N = k = 16 links: PB=0.9116=0.221P_B = 0.91^{16} = 0.221
  • TST with c=l=32c = l = 32 slots: PB=0.9132=0.0489P_B = 0.91^{32} = 0.0489
  • TST with time expansion l=64l = 64 (p′=0.35p' = 0.35): PB=0.577564≈5.5×10−16P_B = 0.5775^{64} \approx 5.5 \times 10^{-16}

Hence TST gives lower blocking at lower cost, which is why large digital exchanges use TST (or TSST/TSSST) structures.

✓ Answer checked by Claude Opus 5.5 (high effort)

All Telecommunications chapter 4 questions →