Queuing Systems

Welcome to the Queing Systems course.

Objectives

Student familiarization with the general principles of the course.

Prerequisites

This information is not available.

Syllabus

The course aims at introducing students to methodologies in modeling and performance evaluation for Internet based communication networks and computer systems. The emphasis is on the analysis of such systems as simple queuing models, complemented by simulation techniques. The course material includes: Overview of probability theory with emphasis on memory-less probability distributions (Poisson and exponential distributions). Definitions of Markov stochastic processes, ergodicity. Definitions and basic models of queuing systems. Arrival processes, departure processes, queue state, steady-state behavior, steady-state probabilities, utilization, average queue size and delay, Little’s formula, throughput, blocking probability. Birth – death processes and applications in simple Markov queuing systems (M/M/1, M/M/1/K, M/M/N, M/M/N/N, state dependent queues). Open and closed networks of queues, Burke’s theorem, Jackson’s theorem, Gordon/Newell theorem. Applications in performance evaluation of data networks, telephone networks and computer systems.