Queueing Theory

Lecture 1
Introduction to Queueing Theory
Introduction
„ In general we do not like to wait.
„ But reduction of the waiting time
usually requires extra investments.
Introduction
„ To decide whether or not to invest, it is
important to know the effect of the
investment on the waiting time.
„ So we need models and techniques to
analyze such situations.
Introduction
„ In this course we treat a number of
elementary queueing models.
„ Attention is paid to methods for the
analysis of these models, and also to
applications of queueing models.
Introduction
„ Important application areas of queueing
models are production systems,
transportation and stocking systems,
communication systems and
information processing systems.
„ Queueing models are particularly useful
for the design of these system in terms
of layout, capacities and control.
Scope of Queueing Theory
„ Queueing Theory is mainly seen as a
branch of applied probability theory.
„ Its applications are in different fields,
e.g. communication networks, computer
systems, machine plants and so forth.
Service Model
Basic Description
„ Consider a service center and a population of
customers, which at some times enter the
service center in order to obtain service.
„ It is often the case that the service center
can only serve a limited number of
customers.
„ If a new customer arrives and the service is
exhausted, he enters a waiting line and waits
until the service facility becomes available.
„ So we can identify three main elements
of a service center
„ A population of customers
„ The service facility
„ The waiting line
„ Also within the scope of queueing
theory is the case where several service
centers are arranged in a network and a
single customer can walk through this
network at a specific path, visiting
several service centers.
Examples
„ As a simple example of a service center
consider an airline counter:
„ Passengers are expected to check in,
before they can enter the plane.
„ The check-in is usually done by a single
employee, however, there are often
multiple passengers.
Examples
„ A newly arriving and friendly passenger
proceeds directly to the end of the queue,
if the service facility (the employee) is
busy.
„ This corresponds to a FIFO service (first
in, first out).
„ Some examples of the use of queueing
theory in networking are the dimensioning
of buffers in routers or multiplexers,
determining the number of trunks in a
central office in POTS, calculating end-to-
end throughput in networks and so forth.
More Examples
Supermarket
„ How long do customers have to wait at

the checkouts?
„ What happens with the waiting time

during peak-hours?
„ Are there enough checkouts?
Production System
„ A machine produces different types of
products.
„ What is the production lead time of an order?

„ What is the reduction in the lead time when

we have an extra machine?
„ Should we assign priorities to the orders?
Post office
„ In a post office there are counters
specialized in e.g. stamps, packages,
financial transactions, etc.
„ Are there enough counters?

„ Separate queues or one common queue

in front of counters with the same
specialization?
Data communication
„ In computer communication networks
standard packages called cells are
transmitted over links from one switch
to the next.
„ In each switch incoming cells can be
buffered when the incoming demand
exceeds the link capacity.
„ Once the buffer is full incoming cells will
be lost.
„ What is the cell delay at the switches?
„ What is the fraction of cells that will be
lost?
„ What is a good size of the buffer?
Parking place
„ They are going to make a new parking

place in front of a super market.

„ How large should it be?
Assembly of printed circuit boards
„ Mounting vertical components on

printed circuit boards is done in an

assembly center consisting of a number
of parallel insertion machines.
„ Each machine has a magazine to store

components.
„ What is the production lead time of the
printed circuit boards?
„ How should the components necessary
for the assembly of printed circuit
boards be divided among the
machines?
Call centers of an insurance company
„ Questions by phone, regarding

insurance conditions, are handled by a

call center.
„ This call center has a team structure,

where each team helps customers from

a specific region only.
„ How long do customers have to wait
before an operator becomes available?
„ Is the number of incoming telephone
lines enough?
„ Are there enough operators?
„ Pooling teams?
Main frame computer
„ Many cashomats are connected to a big
main frame computer handling all
financial transactions.
„ Is the capacity of the main frame
computer sufficient?
„ What happens when the use of
cashomats increases?
What questions does QT answer?
„ Queueing Theory tries to answer questions
like e.g.
„ The mean waiting time in the queue
„ The mean system response time (waiting time in
the queue plus service times)
„ Mean utilization of the service facility
„ Distribution of the number of customers in the
queue
„ Distribution of the number of customers in the
system and so forth
What questions does QT answer?
„ These questions are mainly investigated
in a stochastic scenario, where e.g. the
interarrival times of the customers or
the service times are assumed to be
random.
Toll booths
„ Motorists have to pay toll in order to

pass a bridge.
„ Are there enough toll booths?
Traffic lights.
„ How do we have to regulate traffic

lights such that the waiting times are

acceptable?