625.734/605.725 Queueing Theory with Applications to Computer Science

Spring 2012

Instructor: Christine Nickel

Email: nickellc@aol.com

Phone: (301)459-5607 home

(703)732-6824 cell

Class Time: Tuesdays 7:20-10:00

Location: APL/K-4

Office Hours: By Appointment

****The final exam in May 8^th and will cover the material on Homeworks 6 – 11.*****

***The 11^th homework set is not due until the day of the final. However if you turn it in next week, I will grade it and let you know of any errors.***

***Projects/Papers are due next week – May 1^st.****

Project Guidelines

Suggested Problems for Exam 2

Course Information

Syllabus

Official EPP Course Homepage

Text

Fundamentals of Queueing Theory, 4^th ed., by D. Gross, J. Shortle, J. Thompson, and C Harris (Wiley 2008).

Homework

· Homework 1 Due 2/7/12

· Homework 2 Due 2/14/12

· Homework 3 Due 2/21/12

· Homework 4 Due 2/28/12

· Homework 5 Due 3/6/12

· Homework 6 Due 3/27/12

· Homework 7 Due 4/3/12

· Homework 8 Due 4/10/12

· Homework 9 Due 4/17/12

· Homework 10 Due 4/24/12

· Homework 11 Due 5/8/12

Suggested Problems for Exam 1

Lecture Notes

· January 31, 2012

· February 7, 2012

· February 14, 2012

· February 21, 2012

· February 28, 2012

· March 6, 2012

· March 27, 2012

· April 3, 2012

· April 10, 2012

· April 17, 2012

· April 24, 2012

Other Useful Information

· Basic Elements of Queueing Theory: Applications to the Modelling of Computer Systems by Philippe Nain

§ This is a good resource to supplement the book. Additionally, for those of you whose probability skills are a little rusty, I highly recommend reading the Probability Refresher in Appendix A.

Asymptotic Notation (little ‘o’):

· Asymptotic Growth of Functions

§ This is review of asymptotic notation definitions. Little ‘o’ notation is on page 5.