Digital Switching I

The course will introduce the learners to basics of digital telephony. It will start with crossbar switch and move to theory of switches. Towards end, packet switching basics will be looked into.
INTENDED AUDIENCE:Students, Teachers, Professionals, Trainers, Leaders, Employers

PREREQUISITES: Preferably should have done Basics of Digital Communications, and Digital Communication Networks.

INDUSTRY SUPPORT: There is no industry support. The course will be useful to the people from telecom industry.

COURSE LAYOUT

Week 1 : Introduction, Basic signaling, Strowger exchange, crossbar, crossbar operation algorithm.Week 2 : Call congestion and time congestion; Lee’s approach, Karnaugh’s approachWeek 3 : Strictly Non-blocking networks, Rearrangeably non-blocking networks; Clos Network; Paull’s matrix; Clos theorem; Strictly non-blocking for f-way multicasting.Week 4 : Slepian Duguid theorem, its proof; Paull’s theorem; Recursive construction; Crosspoint complexity for rearrangebly and strictly non-blocking networksWeek 5: Cantor network; proof; Wide-sense non-blocking network – example network and proof.Week 6: Packet Switching, Buffering strategies, Input Queued Switch, Output Queued switchWeek 7: Banyan Networks, Delta Network, Shufflenet as Delta network – proof.Week 8 : Buffered Banyan network (buffering at each switching element), Computional analysis.