retrial queueing system
Recently Published Documents


TOTAL DOCUMENTS

143
(FIVE YEARS 39)

H-INDEX

11
(FIVE YEARS 2)

2021 ◽  
Vol 56 (1) ◽  
pp. 96-102
Author(s):  
M.S. Bratiichuk ◽  
A.A. Chechelnitsky ◽  
I.Ya. Usar

The article deals with M/M/1 -type retrial queueing system with finite orbit. It is supposedthat service rate depends on the loading of the system. The explicit formulae for ergodicdistribution of the number of customers in the system are obtained. The theoretical results areillustrated by numerical examples.


Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2232
Author(s):  
Anatoly Nazarov ◽  
Alexander Moiseev ◽  
Tuan Phung-Duc ◽  
Svetlana Paul

In the paper, we consider a multi-server retrial queueing system with setup time which is motivated by applications in power-saving data centers with the ON-OFF policy, where an idle server is immediately turned off and an off server is set up upon arrival of a customer. Customers that find all the servers busy join the orbit and retry for service after an exponentially distributed time. For this model, we derive the stability condition which depends on the setup time and turns out to be more strict than that of the corresponding model with an infinite buffer which is independent of the setup time. We propose asymptotic methods to analyze the system under the condition that the delay in the orbit is extremely long. We show that the scaled-number of customers in the orbit converges to a diffusion process. Using this diffusion limit, we obtain approximations for the steady-state probability distribution of the number of busy servers and that of the number of customers in the orbit. We verify the accuracy of the approximations by simulations and numerical analysis. Numerical results show that the retrial system under the limiting condition consumes more energy than that with an infinite buffer in front of the servers.


Sign in / Sign up

Export Citation Format

Share Document