Syllabus

Syllabus & (tentative) Schedule

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

Schedule at-a-glance

Class times and location: Tuesday & Thursday, 10:00am-11:30am in Lopata 103.

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

Hmwk	Quizz	Exam	No class

	Tu.	Th.	Tu.	Th.	Tu.	Th.	Tu.	Th.	Tu.	Th.
August	30
September		1	6	8	13	15	20	22	27	29
October	4	6	11	13	18	20	25	27
November	1	3	8	10	15	17	22	24	29
December		1	6	8			20

FINAL EXAM: Tuesday December 20, 2016, 6:00-8:00pm in TBD.

Detailed Schedule & Syllabus

NOTE: This schedule in TENTATIVE, and 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.

August

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

September

Date	Scope	Material & Reading Assignments (To Be Read Ahead of Class)	Notes & slides (If any)	Review Problems	Quizzes & Homeworks
9/1	A brief review of probability topics, both basic and slightly more advanced, which are needed in the course	Chapters 3 & 5	Slides 2 and Lecture 2 problems	Review 2 Problems
9/6	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
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	Slides 4	Review 4 Problems
9/13	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
9/15	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)	Slides 5a	Review 6 Problems
9/20	Infinite DTMCs and some simple applications	Chapter 8 (Sections 8.8 to 8.10)	Slides 5a	Review 7 Problems	Quiz 1
9/22	Ergodicity for finite and infinite DTMCs	Chapter 9	Slides 5b	Review 8 Problems
9/27	Brief review of z-transforms and applications to DTMCs	Chapter 25 (the parts about z-transforms) & Chapter 10	Slides 6 and Slides 7 and Lecture 9 problem	Review 9 Problems
9/29	Exponential distribution & Poisson process	Chapter 11	Slides 8	Review 10 Problems	HWK #2

October

Date	Scope	Material & Reading Assignments (To Be Read Ahead of Class)	Notes & slides (If any)	Review Problems	Quizzes & Homeworks
10/04	Introduction to continuous time Markov chains (CTMC)	Chapter 12	Slides 9 (CTMC)	Review 11 Problems
10/6	M/M/1 queue & PASTA theorem	Chapter 13	Slides 9 and Slides 8 (for PASTA) and Lecture 12 problems	Review 12 Problems
10/11	M/M/k/k (Erlang-B formula) and M/M/k queueing systems	Chapter 14	Slides 9	Review 13 Problems	Quiz 2
10/13	Applications to system provisioning	Chapter 15 + Sections 8.11 & 8.12 of Zukerman's book (Hayward approximation and Equivalent Random Theory)	Slides 10	Review 14 Problems	HWK #3
10/18	FALL BREAK	NO CLASS
10/20	Revisiting time reversibility and applications to network of queues	Chapter 16	Slides 11	Review 15 Problems
10/25	IN CLASS MIDTERM
10/27	Jackson networks (of queues) and product form distribution	Chapter 17	Slides 11 and Lecture 16 problems	Review 16 Problems

November

Date	Scope	Material & Reading Assignments (To Be Read Ahead of Class)	Notes & slides (If any)	Review Problems	Quizzes & Homeworks
11/01	Classed Jackson networks	Chapter 18	Slides 11 and Lecture 17 problems	Review 17 Problems
11/03	Closed Jackson networks & mean value analysis (MVA)	Chapter 19	Slides 11	Review 18 Problems	HWK #4
11/08	A quick introduction to Matrix-Analytic techniques and phase-type distributions	Chapter 21	Slides 12	Review 19 Problems
11/10	Processor sharing queues	Chapter 22	Slides 13	Review 20 Problems	Quiz 3
11/15	The M/G/1 queue and Renewal-Reward theorem	Chapter 23	Slides 14 and Lecture 21 problems	Review 21 Problems
11/17	A brief foray into server assignment policies	Chapter 24	Slides 15	Review 22 Problems	HWK #5
11/22	Transform analysis of M/G/1 queue (and review of transforms)	Chapter 25 and Chapter 26 (Section 1)	Slides 16	Review 23 Problems
11/24	NO CLASS - THANKSGIVING
11/29	M/G/1 queue and application to power optimization	Chapter 26 (Section 2) and Chapter 27	Slides 17	Review 24 Problems

December

Date	Scope	Material & Reading Assignments (To Be Read Ahead of Class)	Notes & slides (If any)	Review Problems	Quizzes & Homeworks
12/01	M/G/1 queue with non-preemptive scheduling priorities	Review Section 3 of Chapter 27, Chapter 29 and Chapter 31	Slides 18	Review 25 Problems and Solution	HWK #6 and Solution
12/06	Preemptive, non-size-based scheduling policies	Chapter 30 & Section 32.2	Slides 19	Review 26 Problems and Solution	Quiz 4 and Solution
12/08	Preemptive size-based scheduling policies	Chapter 32 (Sections 32.3 and onward) & Chapter 33	Slides 20	Review 27 problems and Solution
12/20	FINAL EXAM (6:00-8:00pm in TBD)	AND SOLUTION