Queueing Theory Essay

1309 Words3 Pages

INTRODUCTION

1.1 DESCRIPTION OF QUEUEING THEORY
Queueing Theory is the branch of applied probability theory which serves to study service prone to congestion. A queueing system can be defined as the customers arriving for the service, wait for the service and leaves the system after being served. The following are the following basic characteristics of queueing system

1.2 ARRIVAL PATTERN OF THE CUSTOMER
It is also known as input process. It can be defined as the process of arrival of customers in the system.The arrival pattern in queueing system is measured by the mean arrival rate or mean inter-arrival time.
1.3 SERVICE PATTERN OF SERVER
Service pattern is defined by the number of services per unit time or service rate. Service may be single or in batches. If there are infinite numbers of services then all the customers served instantaneously on the arrival and there will be no queue. If the number of services is finite, then the customers are served according to the specific order. Further the customer may be served in batches of fixed size or of variable size rather than individually by the same server, such as computer with parallel processing of people boarding in a bus. The service system in this case is termed as bulk service.

1.4 QUEUE DISCIPLINE
Queue Discipline refers to the rule by which customers are selected for service when a queue is formed. There are different ways by which a customer can attain the service. Most often practiced queueing system is FIFO (first in first out) in this type customers are served in the strict order in which they arrive.
Other queue rule is LIFO (last in first out) in this customer who enters last in the system is served first. Other discipline is SIRO (selection of ...

... middle of paper ...

...s are shown.

Markov Process
A Markov process is a stochastic (random) process in which the probability distribution of the current value is conditionally independent of the series of past value, a characteristic called the Markov Property .i.e. the future of a process does not depend on its past, only on its present
Markov property: the conditional probability distribution of future states of the process, given the present state and all past states, depends only upon the present state and not on any past states.
We determined various performance measures using recursive method and matrix method. Various probabilities are found out by using recursive method and performance measure are determined by matrix method using computer language MATLAB. Hence, with the help of these probabilities queue size has been determined and various applications have been discussed.

More about Queueing Theory Essay

Open Document