Scribd
Upload
5 views3 pages

02 Queuing Models

Queuing theory is the mathematical study of waiting lines, used to predict queue lengths and waiting times in various systems. It includes key concepts like arrival and service processes, queue discipline, and system capacity, along with different queuing models such as M/M/1 and M/G/1. Applications of queuing theory span telecommunications, computer networks, manufacturing systems, and customer service, aiming to optimize performance and reduce wait times.

Uploaded by

meghanaalluri2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views3 pages

02 Queuing Models

Queuing theory is the mathematical study of waiting lines, used to predict queue lengths and waiting times in various systems. It includes key concepts like arrival and service processes, queue discipline, and system capacity, along with different queuing models such as M/M/1 and M/G/1. Applications of queuing theory span telecommunications, computer networks, manufacturing systems, and customer service, aiming to optimize performance and reduce wait times.

Uploaded by

meghanaalluri2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Queuing Models

1. Introduction to Queuing Theory


Queuing theory is the mathematical study of waiting lines, or queues. It is used
to predict queue lengths and waiting times in systems such as customer service,
telecommunications, and computer networks. Understanding and analyzing
queues help in optimizing system performance and efficiency.
2. Basic Concepts and Terminology
2.1 Queue
A queue is a line of waiting customers or items. The primary focus is to study the
behavior of entities in the queue, including their arrival, waiting time, and service
time.
2.2 Arrival Process
The arrival process describes the way entities join the queue. It can be random
or deterministic. In most queuing models, the arrival process is modeled as a
Poisson process.
2.3 Service Process
The service process describes how entities are served once they reach the front
of the queue. The service time can also be random or deterministic.
2.4 Queue Discipline
Queue discipline refers to the rule or policy used to determine the order in which
entities in the queue are served. Common disciplines include First-In-First-Out
(FIFO), Last-In-First-Out (LIFO), and priority-based servicing.
2.5 System Capacity
System capacity refers to the maximum number of entities that the system can
accommodate at any given time. It can be finite or infinite.
3. Types of Queuing Models
3.1. M/M/1 Queuing Model:
Characteristics
 Arrival Process: Poisson process (arrival rate λ).
 Service Process: Exponential service time distribution (service rate μ).
 Number of Servers: Single server.
 Queue Discipline: First-In-First-Out (FIFO).
 Capacity: Infinite.
3.2 M/M/c Queuing Model
Characteristics
 Arrival Process: Poisson process (arrival rate λ).
 Service Process: Exponential service time distribution (service rate μ).
 Number of Servers: Multiple servers (c servers).
 Queue Discipline: First-In-First-Out (FIFO).
 Capacity: Infinite.
3.3 M/G/1 Queuing Model
Characteristics
 Arrival Process: Poisson process (arrival rate λ).
 Service Process: General service time distribution.
 Number of Servers: Single server.
 Queue Discipline: First-In-First-Out (FIFO).
 Capacity: Infinite.
3.4 M/D/1 Queuing Model
Characteristics
 Arrival Process: Poisson process (arrival rate λ).
 Service Process: Deterministic (fixed) service time.
 Number of Servers: Single server.
 Queue Discipline: First-In-First-Out (FIFO).
 Capacity: Infinite.
3.5 G/G/1 Queuing Model
Characteristics
 Arrival Process: General arrival process.
 Service Process: General service time distribution.
 Number of Servers: Single server.
 Queue Discipline: First-In-First-Out (FIFO).
 Capacity: Infinite.

4. Performance Metrics
4.1 Average Queue Length
The average number of entities in the queue (Lq) is a key performance metric
that helps in understanding system congestion.
4.2 Average Waiting Time
The average time an entity spends waiting in the queue (Wq) is another
important metric.
4.3 Probability of n Customers in the System
This metric gives the probability that there are exactly n customers in the system
at a given time.
4.4 System Throughput
System throughput is the rate at which entities are served and leave the system.

5. Applications of Queuing Theory


Queuing theory has a wide range of applications across various fields:
- Telecommunications: Managing call centers, data transmission, and network
traffic
- Computer Networks: Optimizing packet switching and data flow
- Manufacturing Systems: Improving production line efficiency and inventory
management
- Customer Service: Reducing wait times and improving service quality in banks,
hospitals, and retail processing.

You might also like