Jump to content
Wikipedia The Free Encyclopedia

Retrial queue

From Wikipedia, the free encyclopedia

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.[1] [2]

References

[edit ]
  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.
Single queueing nodes
Arrival processes
Queueing networks
Service policies
Key concepts
Limit theorems
Extensions
Information systems
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 Wikipedia by expanding it.

AltStyle によって変換されたページ (->オリジナル) /