Queueing Systems

Professors K. Maliatsos
Course category OPT/T&N
Course ID DS-013
Credits 5
Lecture hours 3 hours
Lab hours 2 hours
Digital resources View on Evdoxos (Open e-Class)

Learning Outcomes

After the successful completion of this course, the student will be able to model queueing systems in the framework of the design, analysis and management of telecommunication networks, computer networks and processing systems. The student will be able to recognize and evaluate alternative choices of methodologies, procedures and queueing models and determine the optimal selection for the evaluation of network and systems performance.

During the laboratory practice, students put the acquired knowledge into practice with the utilization of programming applications in a simulation environment.

Course Contents

  • Structure of queuing systems; arrival process; queues; service systems.
  • Review of relevant probability laws, probability density functions, stochastic processes.
  • Continuous time Markov chains, discrete time Markov chains.
  • Birth – death processes.
  • Poisson processes.
  • Μ/Μ/1; Μ/Μ/κ; Μ/Μ/1/κ; Μ/Μ/κ/κ; Μ/G/1; G/G/1 Models.
  • Networks of queuing systems, Kleinrock approximation, Jackson networks.
  • Applications: students are asked to conduct small projects related to queuing systems and the analytical evaluation of communication and computer systems.

Furthermore, in the platform eclass/Evdoxos lecture notes, exercises and laboratory exercises are posted for the students.

Recommended Readings

  • Ronald W. Wolff, Stochastic Modeling and the Theory of Queues (Prentice Hall 1989)
  • Philippe Robert, Stochastic Networks and Queues (Springer-Verlag, 2003)
  • M. Ross, Stochastic Processes (Wiley, 1995)
  • D. Bertsekas, R. Gallager, Data Networks (Prentice Hall, 1991)
  • Menasce, Almeida, Capacity Planning for Web Services (Prentice Hall, 2001)