Syllabus

Syllabus & (tentative) Schedule

THE INFORMATION ON THIS WIKI PAGE IS EVOLVING AND WILL BE UPDATED THROUGHOUT SEMESTER

Schedule at-a-glance

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

Hmwk	Quizz	Exam	No class

	Tu.	Th.	Tu.	Th.	Tu.	Th.	Tu.	Th.	Tu.	Th.
August	25	27
September	1	3	8	10	15	17	22	24	29
October		1	6	8	13	15	20	22	27	29
November	3	5	10	12	17	19	24	26
December	1	3			15

FINAL EXAM: Tuesday December 15, 2015, 6:00-8:00pm in TBD.

Detailed Schedule & Syllabus

NOTE: This schedule in ONLY TENTATIVE, and VERY LIKELY to change as certain topics may end-up being harder or easier than anticipated. Changes to the schedule will be reflected as quickly as possible on this page.

Date	Scope	Material & Reading Assignments (To Be Read Ahead of Class)	Notes & slides (If any)	Review Problems	Quizzes & Homeworks
8/25	Course overview, logistics, (motivating) examples and terminology	Chapters 1 & 2	Notes 0 Slides 1	Problems 2.1 & 2.2 and Solution
8/27	A brief review of probability topics, both basic and slightly more advanced, which are needed in the course	Chapters 3 & 5	Slides 2 Lecture 2 problems	Review 2 Problems and Solution
9/1	A brief review of probability topics, both basic and slightly more advanced, which are needed in the course	Chapters 3 & 5	Slides 3	Review 3 Problems and Solution
9/3	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	Slides 4	Review 4 Problems and Solution
9/8	A first foray into Markov chain focused on finite Markov chains and their applications to simple problems.	Chapter 8 (Sections 8.1 to 8.7)	Slides 5	Review 5 Problems and Solution
9/10	Infinite Markov chains and some simple applications	Chapter 8 (Sections 8.8 to 8.10)	Slides 5	Review 6 Problems and Solution	HWK #1 and Solution
9/15	Ergodicity for finite and infinite, discrete time Markov chains (DTMC)	Chapter 9	Slides 5	Review 7 Problems and Solution	Quiz 1 and Solution
9/17	Some more on ergodicity & a brief review of z-transforms	Chapter 9 & Chapter 25		Review 8 Problems
9/22	Application examples (page rank & Aloha protocol) including applications of z-transforms	Chapter 10		Review 9 Problems
9/24	Exponential distribution and Poisson process	Chapter 11			HWK #2
9/29	Introduction to continuous time Markov chains (CTMC)	Chapter 12
10/1	M/M/1 queue & PASTA theorem	Chapter 13
10/6	M/M/k/k (Erlang-B formula) and M/M/k queueing systems	Chapter 14			Quiz 2
10/8	Applications to system provisioning	Chapter 15			HWK #3
10/13	IN CLASS MIDTERM
10/15	Revisiting time reversibility and applications to network of queues	Chapter 16
10/20	Jackson networks (of queues) and product form distribution	Chapter 17
10/22	Classed Jackson networks	Chapter 18
10/27	Closed Jackson networks & mean value analysis (MVA)	Chapter 19			HWK #4
10/29	A quick introduction to Matrix-Analytic techniques and phase-type distributions	Chapter 21
11/3	Processor sharing queues	Chapter 22			Quiz 3
11/5	The M/G/1 queue and Renewal-Reward theorem	Chapter 23
11/10	A brief foray into server assignment policies	Chapter 24			HWK #5
11/12	Transform analysis of M/G/1 queue (and review of transforms)	Chapter 25 and Chapter 26 (Section 1)
11/17	M/G/1 queue and application to power optimization	Chapter 26 (Section 2) and Chapter 27 (Sections 1 and 2)
11/19	M/G/1 queue with setup and non-preemptive scheduling priorities	Chapter 27 (Section 3) and Chapter 31
11/24	More on smart scheduling policies	Chapters 28 & 29			HWK #6
11/26	NO CLASS - THANKSGIVING
12/1	Preemptive scheduling policies	Chapter 30 (and Chapter 32 as time permits)
12/3	Review session	-	-	-	Quiz 4
12/15	FINAL EXAM