Retrial queue explained

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]

Notes and References

  1. Yang . Tao . Templeton . J. G. C. . 1987 . A survey on retrial queues . . 2 . 3 . 201-233 . . 10.1007/BF01158899.
  2. Book: Artalejo . Jesús R. . Gómez-Corral . Antonio . 2008 . Retrial Queueing Systems: A Computational Approach . 978-3-540-78724-2 . 10.1007/978-3-540-78725-9 . Springer Berlin Heidelberg.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Retrial queue".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.