Calculation of steady-state probabilities of M/M queues: Further approaches.
Smith, David K. (2002)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Smith, David K. (2002)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Jesús Artalejo, Gennadi Falin (2002)
Revista Matemática Complutense
Similarity:
We describe main models and results of a new branch of the queueing theory, theory of retrial queues, which is characterized by the following basic assumption: a customer who cannot get service (due to finite capacity of the system, balking, impatience, etc.) leaves the service area, but after some random delay returns to the system again. Emphasis is done on comparison with standard queues with waiting line and queues with losses. We give a survey of main results for both single server...
Saulius Minkevičius, Stasys Steišŭnas (2005)
Control and Cybernetics
Similarity:
Wood, David R. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Oleg Tikhonenko, Wojciech M. Kempa (2013)
Kybernetika
Similarity:
A multi-server -type queueing system with a bounded total volume and finite queue size is considered. An AQM algorithm with the “accepting” function is being used to control the arrival process of incoming packets. The stationary queue-size distribution and the loss probability are derived. Numerical examples illustrating theoretical results are attached as well.
Bramson, Maury (2008)
Probability Surveys [electronic only]
Similarity: