Queueing Theory

What Does Queueing Theory Mean?

Queueing theory is the study of queueing systems in which individual objects are processed in a linear way. This type of observational process is useful in IT system engineering and other fields.


Techopedia Explains Queueing Theory

Aspects of queueing theory involve looking at the source of items in the queue, wait times for these items, demand and supply in terms of input, and the general management of the queue itself. Evaluating a “first in first out” (FIFO) or “last in first out” (LIFO) input process is an example of the implementation of queueing theory.

Engineers and other professionals may use queueing theory in a variety of ways. There is the general evaluation of how resources are used in a network system, where CPU performance might be monitored, or professionals might look at response times for processes. Generally, queueing theory helps with workflow management and identifying bottlenecks in systems, and generally improving IT performance.


Related Terms

Margaret Rouse
Technology Expert

Margaret is an award-winning technical writer and teacher known for her ability to explain complex technical subjects to a non-technical business audience. Over the past twenty years, her IT definitions have been published by Que in an encyclopedia of technology terms and cited in articles by the New York Times, Time Magazine, USA Today, ZDNet, PC Magazine, and Discovery Magazine. She joined Techopedia in 2011. Margaret's idea of a fun day is helping IT and business professionals learn to speak each other’s highly specialized languages.