22907 Queueing Theory and Applications in Computer Science

Credits: 4 graduate credits in Computer Science

Prerequisite: Admission to the graduate program in Computer Science 1

Recommended: Computer Networks I

The course is based on chapters 1, 2, 3 and 6 in Computer Networks and Systems: Queueing Theory and Performance Evaluation (3rd ed.), by T.G. Robertazzi (Springer Verlag, 2000). The materials include an introduction to stochastic processes.

Queueing theory deals with the analysis of queues through mathematical models and with the development of solutions to these models. The theory is used extensively in many fields. In computer science, queueing theory is used primarily to analyze resource sharing in computer systems and to design and analyze computer communication networks.

The course examines the theory of the basic classical queueing models in both single queueing systems and networks of queues. It deals with performance measures and evaluation of queueing systems and the application of the theory in various fields, particularly in computer science. The course deals mainly with Markov chains, as well as other continuous and discrete chains.

1Students who have not fulfilled this requirement may, under certain circumstances, enroll in this course.