EE 6420 Queueing Theory

Spring 2023


Course Staff

Instructor:

Jay Cheng (鄭  傑), Delta 811 (台達館 811), ext. 62207.

Lectures: M3M4W3, Delta 212 (台達館 212).

Office Hours: M2W2, after classes, or by appointment.

Teaching Assistants:

湯明哲 (TommyT0105@gmail.com)

EECS 805 (資電館805), ext. 34154

TAs' Office Hours: W4


Announcements

The following schedule is subject to change as the course progresses, and you should come back frequently for the most recent update.
  1. Week 1: Probability, Chapter 1, pp. 1~8
  2. Week 2: Probability, Chapter 1, pp. 9~14 + Chapter 2, pp. 1~4
  3. Week 3: Probability, Chapter 3, pp. 1~15
  4. Week 4: Probability, Chapters 4~5
  5. Week 5: Probability, Chapters 6~7
  6. Week 6: Probability, Chapters 8~9
  7. Week 7: Probability, Chapters 10~11
  8. Week 8: Holiday
  9. Week 9: Chapter 1, pp. 1~8 + Chapter 2, pp. 1~3
  10. Week 10: Chapter 2, pp. 4~13
  11. Week 11: Chapter 2, pp. 14~25
  12. Week 12: Chapter 3, pp. 1~15
  13. Week 13: Chapter 3, pp. 16~30
  14. Week 14: Chapter 4, pp. 1~14
  15. Week 15: Chapter 4, pp. 15~28
  16. Week 16: Chapter 4, pp. 29~46
  17. Week 17: Chapter 5, pp. 1~14
  18. Week 18: Final

Textbook

J. F. Shortle, J. M. Thompson, D. Gross, and C. M. Harris, "Fundamentals of Queueing Theory," 5th Ed. Hoboken, NJ: John Wiley & Sons, 2018.
(Textbook website: http://mason.gmu.edu/~jshortle/fqt5th.html)

References

S. Ghahramani, "Fundamentals of Probability, with Stochastic Processes," 3rd ed., Upper Saddle River, NJ: Prentice Hall, 2005.

S. Resnick, "A Probability Path," Birkhauserl, 1999.

Randolph Nelson, "Probability, Stochastic Processes, and Queueing Theory: The Mathematics of Computer Performance Modelling," New York, NY: Springer, 1995.

L. Kleinrock, "Queueing Systems, Vol. 1: Theory," New York, NY: John Wiley & Sons, 1975.

L. Kleinrock, "Queueing Systems, Vol. 2: Computer Applications," New York, NY: John Wiley & Sons, 1976.


Course Descriptions

This course is an introduction to the elementary queueing theory and its applications.

Syllabus

1. Introduction

2. Review of Probability and Stochastic Processes

3. Simple Markovian Queueing Models

4. Advanced Markovian Queueing Models

5. Networks, Series, and Cyclic queues

6. General Arrival or Service Patterns


Grading

Your grade = Homeworks & Exams (50%) + In-class Q&A and presentation (50%)


Go to Jay's Homepage