Misplaced Pages

Retrial queue

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

In queueing theory, a discipline within the mathematical theory of probability, a retrial queue is a model of a system with finite capacity, where jobs which arrive and find the system busy wait for some time before trying again to enter the system. Examples of such systems include making restaurant reservations and packet switching networks.

References

  1. Yang, Tao; Templeton, J. G. C. (1987). "A survey on retrial queues". Queueing Systems. 2 (3). Kluwer Academic Publishers: 201–233. doi:10.1007/BF01158899.
  2. Artalejo, Jesús R.; Gómez-Corral, Antonio (2008). Retrial Queueing Systems: A Computational Approach. Springer Berlin Heidelberg. doi:10.1007/978-3-540-78725-9. ISBN 978-3-540-78724-2.
Queueing theory
Single queueing nodes
Arrival processes
Queueing networks
Service policies
Key concepts
Limit theorems
Extensions
Information systems
Category
Stochastic processes
Discrete time
Continuous time
Both
Fields and other
Time series models
Financial models
Actuarial models
Queueing models
Properties
Limit theorems
Inequalities
Tools
Disciplines


Stub icon

This probability-related article is a stub. You can help Misplaced Pages by expanding it.

Categories:
Ad.

Before you begin

Get Life Coaching Tips
Or continue to this article
X