Modules / Lectures
Module NameDownloadDescriptionDownload Size
Introduction, Basic signaling, Strowger exchange, crossbar, crossbar operation algorithm.week1week1234 kb
Call congestion and time congestion; Lee’s approach, Karnaugh’s approachweek2week2234 kb
Strictly Non-blocking networks, Rearrangeably non-blocking networks; Clos Network; Paull’s matrix; Cweek3week3232 kb
Slepian Duguid theorem, its proof; Paull’s theorem; Recursive construction; Crosspoint complexity foweek4week4234 kb
Cantor network; proof; Wide-sense non-blocking network – example network and proofweek5week5234 kb
Packet Switching, Buffering strategies, Input Queued Switch, Output Queued switchWeek 6 Assignment 1Week 6 Assignment 1235 kb
Packet Switching, Buffering strategies, Input Queued Switch, Output Queued switchweek6week6284 kb
Banyan Networks, Delta Network, Shufflenet as Delta network – proof.week7week7262 kb
Buffered Banyan network (buffering at each switching element), Computional analysisweek8week8211 kb


Sl.No Chapter Name MP4 Download Transcript Download
1Introduction to Telephony and NetworksDownloadDownload
Verified
2Strowger Automatic ExchangeDownloadDownload
Verified
3Crossbar SwitchingDownloadDownload
Verified
4Logic Circuit for Crosspoint OperationDownloadDownload
Verified
5Introduction to Multistage Interconnection NetworksDownloadDownload
Verified
6Blocking probability of crossbar switchesDownloadDownload
Verified
7Call congestion and time congestioDownloadDownload
Verified
8Clos networkDownloadDownload
Verified
9Lee's approximationDownloadDownload
Verified
10Karnaugh's approximationDownloadDownload
Verified
11Time switchDownloadDownload
Verified
12Time switch and Clos networkDownloadDownload
Verified
13TST switch, Strictly Non-blocking network, Rearrangeably non-blocking networkDownloadDownload
Verified
14Paull's MatrixDownloadDownload
Verified
15f-way multicastingDownloadDownload
Verified
16Strictly sense non blocking multicasting switchDownloadDownload
Verified
17Rearrangeably non blocking networksDownloadDownload
Verified
18Slepian Duguid theorem, Paull's theoremDownloadDownload
Verified
19Paull's matrix for rearrangeabbly non blocking networksDownloadDownload
Verified
20Recursive construction; Crosspoint complexity for rearrangebly and strictly non-blocking networksDownloadDownload
Verified
21Cantor networkDownloadDownload
Verified
22Wide-sense non blocking networkDownloadDownload
Verified
23Example of wide -sense non-blocking switchDownloadDownload
Verified
24Packet SwitchingDownloadDownload
Verified
25Buffering strategiesDownloadDownload
Verified
26Output Queued SwitchDownloadDownload
Verified
27Input Queued SwitchDownloadDownload
Verified
28Banyan Network, Delta NetworkDownloadDownload
Verified
29Shufflenet as Delta networkDownloadDownload
Verified
30Performance analysis of crossbar and delta networkDownloadDownload
Verified
31Properties of Delta NetworkDownloadDownload
Verified
32Buffered and Unbuffered Delta networkDownloadDownload
Verified
33Analysis of Buffered Delta Network -1 of 3DownloadDownload
Verified
34Analysis of Buffered Delta Network-2of 3DownloadDownload
Verified
35Analysis of Buffered Delta Network-3of 3DownloadDownload
Verified