Syllabus

Syllabus & Schedule

THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY

Schedule at-a-glance

Class times and location: Monday & Wednesday, 4:00pm-5:20pm in TBD.

Legend: date (quizzes) and due date (homeworks)

Quiz	Hmwk	No class

	Mo.	We.	Mo.	We.	Mo.	We.	Mo.	We.	Mo.	We.
August	30
September		1	6	8	13 (H1)	15(Q1)	20	22	27 (H2)	29 (Q2)
October	4	6	11	13 (H3)	18 (Q3)	20	25	27 (H4)
November	1 (Q4)	3	8	10	15 (H5)	17 (Q5)	22	24	29
December	6	8 (H6)
		8 (Q6)

Detailed Schedule & Syllabus

NOTE: This schedule in TENTATIVE, and may change depending on the speed at which we cover different topics. Changes to the schedule will be reflected as quickly as possible on this page.

August

Unit	Date	Scope	Material & Reading Assignments (To Be Read Ahead of Class)	Notes & slides (If any)	Preview Problems	Quizzes & Homeworks
U0	8/30	Course overview, logistics, (motivating) examples and terminology	Chapters 1 & 2	Notes 0 Intro & Nomenclature	Preview Problems 1

September

Unit	Date	Scope	Material & Reading Assignments (To Be Read Ahead of Class)	Notes & slides (If any)	Preview Problems	Quizzes & Homeworks
U1	9/1	A brief review of probability topics, both basic and slightly more advanced, which are needed in the course	Chapters 3 & 5	Probability Refresher and Practice Problems	Preview Problems 2
U1	9/6	An introduction of general principles such as Little's Law and various other "laws" and bounds for closed system, which hold with little or no assumptions	Chapters 6 & 7	Little & Operational Laws	Preview Problems 3
U1	9/8	An introduction of general principles such as Little's Law and various other "laws" and bounds for closed system, which hold with little or no assumptions	Chapters 6 & 7	Little & Operational Laws	NA
U2	9/13	A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems.	Chapter 8 (Sections 8.1 to 8.7)	Discrete Time Markov Chains and Web caching as a DTMC	Preview Problems 5]	HWK #1
U2	9/15	Infinite DTMCs and some simple applications	Chapter 8 (Sections 8.8 to 8.10)	Discrete Time Markov Chains and DTMC Examples	Preview Problems 6	Quiz 1
U2	9/20	Ergodicity, balance equations, and time reversibility for DTMCs	Chapter 9	Ergodicity and more	Preview Problems 7
U2	9/22	Review of z-transforms and applications to DTMCs	Chapter 25 (the parts about z-transforms) & Chapter 10 (mostly Section 10.3, though the others are of independent interest)	z-transforms and z-transform solution for Geom/Geom/1 queue	Preview Problems 8
Open	9/27	U2 Recap session	All U2 material			HWK #2
U3	9/29	Exponential distribution & Poisson process	Chapter 11	Exponential & Poisson Distributions (except the material on PASTA)	Preview Problems 9	Quiz 2

October

Unit	Date	Scope	Material & Reading Assignments (To Be Read Ahead of Class)	Notes & slides (If any)	Preview Problems	Quizzes & Homeworks
U3	10/4	Introduction to continuous time Markov chains (CTMC), M/M/1 queue & PASTA theorem	Chapters 12 & 13	Continuous Time Markov Chains plus Exponential & Poisson Distributions (for PASTA), and and some related problems]	Preview Problems 10
U3	10/6	M/M/k/k (Erlang-B formula) and M/M/k queueing systems	Chapter 14	Continuous Time Markov Chains	Preview Problems 11
U3	10/11	Applications to system provisioning	Chapter 15 + Sections 8.11 & 8.12 of Zukerman's book (Hayward approximation and Equivalent Random Theory)	System Provisioning	Preview Problems 12
Open	10/13	U3 Recap session	All U3 material	Review 2		HWK #3
U4	10/18	Revisiting time reversibility and applications to network of queues	Chapter 16	Burke Theorem, Reversibility, and Basic Networks of Queues	Preview Problems 13	Quiz 3
U4	10/20	Jackson networks (of queues) and product form distribution	Chapter 17	Jackson Networks of Queues and Chapter 17 problem	Preview problems 14
U4	10/25	Classed Jackson networks + Mean Value Analysis	Chapters 18 & 19	Classed Networks of Queues & Mean Value Analysis and Chapter 18 problem	Preview Problems 15
Open	10/27	U4 Recap session	All U4 material	Review 3		HWK #4

November

Unit	Date	Scope	Material & Reading Assignments (To Be Read Ahead of Class)	Notes & slides (If any)	Preview Problems	Quizzes & Homeworks
U5	11/1	A quick introduction to Matrix-Analytic techniques and phase-type distributions	Chapter 21	Matrix Analytic Techniques	Preview Problems 16	Quiz 4
U5	11/3	Processor sharing queues	Chapter 22	Processor Sharing Queues	Preview Problems 17
U5	11/8	The M/G/1 queue and Renewal-Reward theorem	Chapter 23	M/G/1 Queue & Renewal Reward Theory and Chapter 23 problems	Preview Problems 18
U5	11/10	A brief foray into task/server assignment policies	Chapter 24	Task/Server Assignment Policies	Preview Problems 19
Open	11/15	U5 Recap session	All U5 material covered so far	Review 4		HWK #5
U5	11/17	Transform analysis of M/G/1 queue (and review of transforms)	Chapter 25 and Chapter 26 (Section 1)	Transform Analysis and Slides 16bis	Preview Problems 20	Quiz 5
U5	11/22	M/G/1 queue and application to power optimization	Chapter 26 (Section 2) and Chapter 27	M/G/1 Busy Period & Power Optimization and Chapter 27 problems	Preview Problems 21
	11/24	NO CLASS - THANKSGIVING BREAK
U5	11/29	Non-preemptive scheduling policies for M/G/1/ queue	Review Section 3 of Chapter 27, Chapter 29 and Chapter 31	Scheduling Non-Preemptive Policies	Preview Problems 22

December

Unit	Date	Scope	Material & Reading Assignments (To Be Read Ahead of Class)	Notes & slides (If any)	Preview Problems	Quizzes & Homeworks
U5	12/6	Preemptive scheduling policies for M/G/1 queue	Chapters 30, 32 & 33	Scheduling Preemptive Policies	Preview Problems 23
Open	12/8	U5 Recap session	All U5 material covered from Quiz 5 onward	Review 5		HWK #6
						Quiz 6