Skip to main content

Time switch and two-stage T-S network

Short answer

A time switch (TSI) moves PCM samples between time slots using speech and control memories. A two-stage TS is possible but impractical because the space stage must use the called party's slot, giving one path and blocking probability 1-(1-p)^2. Adding a third stage to form TST provides alternative internal slots and solves blocking.

What is Time (T) Switch? How does it work? Is it possible to make a switching network in a digital exchange with the help of two stage Time-Space (TS) switch? If not, explain why and how this problem is solved.

What is a time (T) switch?

A time switch, or Time Slot Interchanger (TSI), is a digital switch that moves PCM samples from one time slot to another on a TDM highway. Since each subscriber has a fixed slot, interchanging slots connects two subscribers.

How does it work?

 TDM in                                TDM out
 ------->+------------------------+------->
         | Speech memory (SM)     |
         | c words x 8 bits       |
         +------------------------+
   write addr ^              ^ read addr
   +-----------+        +-----------+
   | slot      |------->| Control   |
   | counter   |        | memory CM |
   +-----------+        +-----------+
                              ^ processor
  • Sequential write, random read: in input slot ii the sample is written into SM(ii). In output slot jj, CM(jj) holds ii, so SM(ii) is read out in slot jj.
  • Random write, sequential read: CM(ii) = jj gives the write address; SM is read in order, so the sample leaves in slot jj.
  • Example: to connect TS3 to TS7 (sequential write), set CM(7) = 3. Delay = 4 slots ≈ 15.6 µs (slot = 3.9 µs).
  • Timing: one write and one read per slot, so taccess≤125 μs/2ct_{access} \le 125\ \mu s / 2c; for c=32c = 32, t≤1.95t \le 1.95 µs.

Is a two-stage TS switch possible?

Partly, but not as a practical exchange network. A TS switch can be built and it will work at very light load, but it suffers from heavy blocking, so it cannot give an acceptable grade of service.

 HW1 -->[TSI 1]--+-----------+--> OHW1
 HW2 -->[TSI 2]--|  N x N    |--> OHW2
  ...            |  space S  |     ...
 HWN -->[TSI N]--+-----------+--> OHWN

Working of TS: to connect A (slot ii, highway aa) to B (slot jj, highway bb):

  1. TSI aa moves A's sample from slot ii to slot jj (the slot B needs).
  2. In slot jj the space stage closes crosspoint (a,b)(a, b), sending the sample to highway bb.

Why the TS switch is not suitable

  1. Single fixed path: the space stage must use slot jj, the called party's slot. If another input highway is already sending a call to highway bb in slot jj, the crosspoint column for bb is busy in slot jj, and the new call is blocked, even though A and B are free.
  2. Also, if slot jj on the output of TSI aa is already used by another call from highway aa (to a different output highway), the call is blocked.
  3. The blocking probability is roughly the chance that one of these links is busy: with link occupancy pp,
PB=1−(1−p)2P_B = 1 - (1 - p)^2

For p=0.5p = 0.5: PB=0.75P_B = 0.75; for p=0.2p = 0.2: PB=0.36P_B = 0.36. Telephone networks need PBP_B of about 0.002 to 0.01. 4. There is no alternative path, so path search cannot help. 5. The same problem exists in the ST switch, where the space stage must use the caller's slot ii.

 Call 1: HW1 -> HW3 using slot 7   (S busy: col 3, slot 7)
 Call 2: HW2 -> HW3, B is in slot 7 -> BLOCKED

How the problem is solved

Add a third stage to create alternative paths: TST (or STS).

 HWa->[TSI-A: i->x]->[S: a->b in x]->[TSI-B: x->j]->HWb
  1. Input T stage: moves the sample from slot ii to any free internal slot xx, not just slot jj.
  2. Space stage: in slot xx connects highway aa to highway bb.
  3. Output T stage: moves the sample from slot xx to the wanted slot jj.
  4. The controller can choose among ll internal slots, so the call is blocked only if all ll are unusable.

Blocking with Lee graph (ll parallel paths, two links each, p′=pc/lp' = pc/l):

PB=[1−(1−p′)2]lP_B = \left[1 - (1 - p')^2\right]^{l}

Example: c=l=32c = l = 32, p=0.5p = 0.5:

PB=(1−0.25)32=0.7532≈1.0×10−4P_B = (1 - 0.25)^{32} = 0.75^{32} \approx 1.0 \times 10^{-4}

compared with 0.750.75 for the TS switch.

Non-blocking TST: with time expansion l≥2c−1l \ge 2c - 1 (e.g. 64 internal slots for 32-slot links), no internal blocking at all.

Other solutions

  • STS: space stages outside and kk TSIs in the middle; kk alternative paths; non-blocking if k≥2N−1k \ge 2N - 1. It needs more hardware than TST.
  • TSST / TSSST: for very large exchanges, the middle space stage is made multistage (Clos), keeping crosspoints low.
NetworkPaths per callBlocking at p=0.5p = 0.5, 32 slots
T onlyNot between highways—
TS / ST1≈ 0.75
TST32≈ 1.0×10−41.0 \times 10^{-4}
TST, l=63l = 63630 (non-blocking)

Hence digital exchanges use TST (time–space–time) networks rather than two-stage TS switches.

✓ Answer checked by Claude Opus 5.5 (high effort)

All Telecommunications chapter 4 questions →