Queuing Theory

Queuing theory is the mathematical study of waiting lines, or queues.
In queueing
theory a model is constructed so that queue lengths and waiting times can be predicted. Queuing theory is generally considered a branch of operations research because the results are often used when making business decisions about the resources needed to provide service. Queuing theory started with research by Agner Krarup Erlang when he created models to describe the Copenhagen telephone exchange. The ideas have since seen applications including telecommunications, traffic engineering, computing and the design of factories, shops, offices and hospitals.
{[[[[Queueing theory is used to study the phenomenon of waiting in lines. Some people use the information gathered from queuing theory in order to determine how to best serve customers and so prevent them from waiting in line longer than they have to. The theory allows researchers to analyze several things such as arriving in line, waiting in line, and the time it takes to service customers. This allows them to gather and derive information on a customers waiting time, the expected amount of customers that will be in a line, the probability of a customer encountering a line, as well as other data. This information is used in order to find ways to reduce lines and wait time. Applications of queueing theory are used in many aspects of business, customer service, commerce, industry, healthcare, and engineering. Customer service applications can especially make use of the information gathered by queueing theory. This
information can be used in order to make decisions on the kind of resources needed to provide service for customers. The data can be also be applied to call centers, network server queuing, telecommunications, and traffic flow. It can even be used to dictate what type of line customers will be standing in while waiting for different types of service.]]]}}}
Limitations of queueing theory
The assumptions of classical queueing theory may be too restrictive to be able to model real-world situations exactly. The complexity of production lines with product-specific characteristics cannot be handled with those models. Therefore specialized tools have been developed to simulate, analyze, visualize and optimize time dynamic queueing line behavior. For example; the mathematical models often assume infinite numbers of customers, infinite queue capacity, or no bounds on inter-arrival or service times, when it is quite apparent that these bounds must exist in reality. Often, although the bounds do exist, they can be safely ignored because the differences between the real-world and theory is not statistically significant, as the probability that such boundary situations might occur is remote compared to the expected normal situation. Furthermore, several studies show the robustness of queueing models outside their assumptions. In other cases the theoretical solution may either prove intractable or insufficiently informative to be useful. Alternative means of analysis have thus been devised in order to provide some insight into problems that do not fall under the scope of queueing theory, although they are often scenario-specific because
they generally consist experimental data.
of
computer simulations or
analysis
of
http://en.wikipedia.org/wiki/Queueing_theory#cite_ref-sun_1-1
Queuing theory A branch of applied probability theory Aka traffic theory, congestion theory, Theory of mass service, theory of Stochastic service systems Applications in - Communication networks - Computer systems - Machine plants, etc
Service center Consider a service center and a population of customers (jobs, tasks) that enters the service center to obtain service If a customer arrives and the service is exhausted, he enters a waiting line
3 elements of a service center Population of customers Server(s) Waiting line

Characteristics of queuing models
Input or arrival (interarrival) distribution Output or departure (service) distribution
Service channels Service discipline Maximum number of customers allowed in the system Calling source
Queuing characteristics
Arrival process Service time distribution Number of servers System capacity Population size Service discipline
Arrival Processes
Suppose jobs arrive at times t1 , t2 , ... ,tj Random variables j = tj - tj-1 are inter-arrival times There are many possible assumptions for the distribution of the j
Typical assumptions for the j: Independent Identically distributed Many other possible assumptions: Bulk arrivals Balking Correlated arrivals For Poisson arrival, the inter-arrival times are: IID (independent and identically distributed) exponentially distributed (i.e., CDF F(x) = 1 - e -x/a) Other common arrival time distributions include Erlang, Hyper-exponential, Deterministic, General (with a specified mean and variance)
Service time Interval spent actually receiving service (exclusive of waiting time)
As with arrival processes, there are many possible assumptions Most common assumptions are IID random variables exponential service time distribution Number of servers Servers may or may not be identical Service discipline determines allocation of customers to servers System capacity Maximum number of customers in the system (including those in service) May be finite or infinite Population size Total number of potential customers May be finite or infinite
Service discipline The order waiting customers are serviced
Many possibilities, including First-come-first-serve (FCFS), the most common Last-come-first-serve (LCFS) Last-come-first-serve preempt resume (LCFS-PR) Round robin (RR) with finite quantum size Processor sharing (PS) --- RR with infinitesimal quantum size Infinite server (IS) Almost anything might be used, depending on the the total state of the queue As expected, service discipline affects the nature of the stochastic process that represents the behavior of the queueing system
Characteristics
The probability density distribution that determines the customer arrivals in the system.
The probability density distribution that determines the customer service times in the system.
Number of Servers
Number of servers available to service the customers.
Number of Channels
Single channel N independent channels Multi channels
Number of Phases/Stages
Queue Discipline -Selection for Service
First com first served (FCFS or FIFO)
Last in First out (LIFO) -Random -Priority
Importance of the Queuing Theory
-Improve Customer Service, continuously. -When a system gets congested, the service delay in the system increases. A good understanding of the relationship between congestion and delay is essential for designing effective congestion control for any system. Queuing Theory provides all the tools needed for this analysis.

Queuing Theory

Uploaded by

Copyright:

Available Formats

Queuing Theory

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Queuing Theory

Uploaded by

Copyright:

Available Formats

Queuing theory is the mathematical study of waiting lines, or queues.

they generally consist experimental data.

3 elements of a service center Population of customers Server(s) Waiting line

Service discipline The order waiting customers are serviced

Number of servers available to service the customers.

Single channel N independent channels Multi channels

Queue Discipline -Selection for Service

First com first served (FCFS or FIFO)

Last in First out (LIFO) -Random -Priority

Importance of the Queuing Theory

You might also like