Who Invented Queuing Theory?
Queuing theory originated in 1909 by Danish mathematician A. K. Erlang in the year 1909 while he was working with the Copenhagen Telephone Company. Erlang investigated the congestion of incoming calls in telephone traffic, and to evaluate the probability of calls arriving at the switchboard, he established mathematical models. He also provided the much-needed initial foundation for the growth of what would later become known as queuing theory.
Many other researchers have also added their findings to the development of queuing theory since then, including Agner Krarup Erlang (A. K. Erlang’s son), David Kendall, and John Little among others. Today, queuing theory has grown to be a popular and respected branch of study that is frequently used in operations research, computer engineering, and industrial engineering.
Queuing Theory
Queuing theory is a specific division of mathematics that focuses on studying waiting lines (queues) in cases where there is an excess of demand for a service as compared to the availability of the service. It gives a way of looking at and analyzing the behaviour of systems which encounter congestion as a normal occurrence: call centres, computer networks, transportation, etc.
By observing queue length, customers’ waiting time, and server utilization, queuing models can become immensely beneficial in resource management and enhancement of systems performance.
In this article, we have covered the basics of Queueing Theory.
Table of Content
- What Is Queuing Theory?
- How Queuing Theory Works
- Who Invented Queuing Theory?
- What Are Basic Elements of Queuing Theory?
- How Do You Use Queuing Theory?
- Examples of Queuing Theory
- Applications of Queuing Theory