Lecture 1 - Introduction to Telephony and Networks
Lecture 2 - Strowger Automatic Exchange
Lecture 3 - Crossbar Switching
Lecture 4 - Logic Circuit for Crosspoint Operation
Lecture 5 - Introduction to Multistage Interconnection Networks
Lecture 6 - Blocking probability of crossbar switches
Lecture 7 - Call congestion and time congestio
Lecture 8 - Clos network
Lecture 9 - Lee's approximation
Lecture 10 - Karnaugh's approximation
Lecture 11 - Time switch
Lecture 12 - Time switch and Clos network
Lecture 13 - TST switch, Strictly Non-blocking network, Rearrangeably non-blocking network
Lecture 14 - Paull's Matrix
Lecture 15 - f-way multicasting
Lecture 16 - Strictly sense non blocking multicasting switch
Lecture 17 - Rearrangeably non blocking networks
Lecture 18 - Slepian Duguid theorem, Paull's theorem
Lecture 19 - Paull's matrix for rearrangeabbly non blocking networks
Lecture 20 - Recursive construction; Crosspoint complexity for rearrangebly and strictly non-blocking networks
Lecture 21 - Cantor network
Lecture 22 - Wide-sense non blocking network
Lecture 23 - Example of wide -sense non-blocking switch
Lecture 24 - Packet Switching
Lecture 25 - Buffering strategies
Lecture 26 - Output Queued Switch
Lecture 27 - Input Queued Switch
Lecture 28 - Banyan Network, Delta Network
Lecture 29 - Shufflenet as Delta network
Lecture 30 - Performance analysis of crossbar and delta network
Lecture 31 - Properties of Delta Network
Lecture 32 - Buffered and Unbuffered Delta network
Lecture 33 - Analysis of Buffered Delta Network - 1 of 3
Lecture 34 - Analysis of Buffered Delta Network - 2 of 3
Lecture 35 - Analysis of Buffered Delta Network - 3 of 3
