This course is designed to provide students with a thorough understanding of the mathematical underpinnings of widely used performance and reliability models and algorithms for the analysis of complex computer systems and communication networks.

Lecture 1 | Introduction and Course Overview | ECE6433_Lecture1 ece6433_problemset1

Lecture 2 | Discrete-time and Continuous-time Markov Chains | ECE6433_Lecture2

Lecture 3 | Birth-Death Processes, M/M/1, M/M/1/N, M/M/m, M/M/inf, M/M/m/m Queues | ECE6433_Lecture3

Lecture 4 | Control of Queues and Product-form Open Networks I | ECE6433_Lecture4

Lecture 5 | Control of Queues and Product-form Open Networks  II | ECE6433_Lecture5 ECE6433_Lecture5_extra

Lecture 6 | Product-form Closed (Gordon-Newell) and Mixed Queuing Networks I | ECE6433_Lecture6

Lecture 7 | Product-form Closed (Gordon-Newell) and Mixed Queuing Networks II | ECE6433_Lecture7

Lecture 8 | Product-form Closed (Gordon-Newell) and Mixed Queuing Networks III | ECE6433_Lecture8b

Lecture 9 | M/G/1 Queue and Queues with Vacations | ECE6433_Lecture9

Lecture 10 | Priority Queuing, Batch Arrivals and G/G/1 Queues | ECE6433_Lecture10

Lecture 11 | Random Access Networks  I | ECE6433_Lecture11

Lecture 12 | Random Access Networks II | ECE6433_Lecture12

Lecture 13 | Reliability Analysis | ECE6433_Lecture13

Lecture 14 | Performability Analysis | ECE6433_Lecture14

Misc. Homeworks | ece6433_problemset2 ece6433_problemset3 ece6433_problemset4 ece6433_problemset5 ece6433_problemset6 ece6433_problemset7

ece6433_courseoutline

ece6433_suggestedprojects