# Simulations Essay

1691 WordsMar 5, 20157 Pages
Queuing Theory and Simulations Student’s Name University Name Date Instructor’s Name Queuing theory is defined as the mathematical method of determining the congestions and delays that would occur with the waiting in a line. Every component in the line is accessed in the queuing theory (Gross D., & Harris C, 1974). This includes the process of arrival, service, and number of servers, number of systems, and the total number of customers. The major objective of the queuing theory is to ensure that the efficiency of the queuing system is improved by reducing the time waiting time for the customer and increasing the number of customers who can be served within short period of time (Gross D., & Harris C, 1974). The basic assumptions that are followed in the queuing theory are as follows: ➢ The system is in complete equilibrium ➢ The time of inter arrival is distributed exponentially. ➢ There is infinite number of request in the queue. ➢ There is no server delay in servicing the request. ➢ There is no limit of to the queue length. ➢ The queue is based on the FIFO pattern ➢ All requests are completed at certain point. In queuing theory customers can arrive in many ways. They may arrive as single or in groups. They may also arrive in a steady time interval or in irregular gaps. Balking is the process under which the customers would arrive and depart due to the very long waiting time. (Gross D., & Harris C, 1974).Some customers may arrive, wait, and get frustrated. They would leave with the frustration and this is termed as reneging. The random arrivals of the customers can be characterized by using the principles of probability. Poisson distribution is the most common distribution form that is used to represent the customers’ arrival. Poisson distribution is considered to be a discrete distribution wherein only certain