Study of a Controllable Queueing System with Unreliable Heterogeneous Servers
- Authors: Efrosinin D.V.1, Farkhadov M.P.1, Stepanova N.V.1
- 
							Affiliations: 
							- Trapeznikov Institute of Control Sciences
 
- Issue: Vol 79, No 2 (2018)
- Pages: 265-285
- Section: Stochastic Systems
- URL: https://journals.rcsi.science/0005-1179/article/view/150805
- DOI: https://doi.org/10.1134/S0005117918020066
- ID: 150805
Cite item
Abstract
We consider a two-channel Markov queueing system with unreliable heterogeneous servers and a common queue. The claims are distributed among the servers with a threshold control policy. According to this policy, a server with the smaller average usage cost must be busy if the system itself is not empty, and the other server is used if the number of customers in the queue exceeds a certain threshold. We analyze the system in stationary mode. We present a method for computing the probabilities of system states and expressions for average performance and reliability characteristics. For the problem of minimizing average losses per unit of time, we obtain a heuristic formula that approximately computes the optimal threshold policy and proposes a method for computing the stationary distribution of the claim waiting time in the system.
About the authors
D. V. Efrosinin
Trapeznikov Institute of Control Sciences
							Author for correspondence.
							Email: dmitry.efrosinin@jku.at
				                					                																			                												                	Russian Federation, 							Moscow						
M. P. Farkhadov
Trapeznikov Institute of Control Sciences
														Email: dmitry.efrosinin@jku.at
				                					                																			                												                	Russian Federation, 							Moscow						
N. V. Stepanova
Trapeznikov Institute of Control Sciences
														Email: dmitry.efrosinin@jku.at
				                					                																			                												                	Russian Federation, 							Moscow						
Supplementary files
 
				
			 
					 
						 
						 
						 
						 
				 
  
  
  
  
  Email this article
			Email this article  Open Access
		                                Open Access Access granted
						Access granted Subscription Access
		                                		                                        Subscription Access
		                                					