Retrial queue

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

^ 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.
^ 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.

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

[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.

[1]

[2]

Retrial queue

References

Read other articles:

Милове

Promiskuitet

Il Demone (poema)

شعب ديدالوس

NGC 6903

Arçelik

Androsace filiformis

Director of the National Security Agency

Carrera de seis días

Make Me Believe (film)

Reiss Nelson

Sherlock Holmes (2014 TV series)

Sokal Raion

Ecological resilience

FBI Ten Most Wanted Fugitives, 1960s

Ì

HPE ProLiant

Goa trance

透磁率

The Get Down (soundtrack)