The Power of Randomized Routing in Heterogeneous Loss Systems

Author(s):  
Arpan Mukhopadhyay ◽  
Ravi R. Mazumdar ◽  
Fabrice Guillemin
2003 ◽  
Vol 14 (2) ◽  
pp. 107-118 ◽  
Author(s):  
Harro L. Hartmann ◽  
Martin Knoke

2015 ◽  
Vol 43 (2) ◽  
pp. 16-18 ◽  
Author(s):  
Brendan Patch ◽  
Thomas Taimre ◽  
Yoni Nazarathy
Keyword(s):  

2015 ◽  
Vol 47 (03) ◽  
pp. 761-786 ◽  
Author(s):  
Jose Blanchet ◽  
Jing Dong

We present the first class of perfect sampling (also known as exact simulation) algorithms for the steady-state distribution of non-Markovian loss systems. We use a variation of dominated coupling from the past. We first simulate a stationary infinite server system backwards in time and analyze the running time in heavy traffic. In particular, we are able to simulate stationary renewal marked point processes in unbounded regions. We then use the infinite server system as an upper bound process to simulate the loss system. The running time analysis of our perfect sampling algorithm for loss systems is performed in the quality-driven (QD) and the quality-and-efficiency-driven regimes. In both cases, we show that our algorithm achieves subexponential complexity as both the number of servers and the arrival rate increase. Moreover, in the QD regime, our algorithm achieves a nearly optimal rate of complexity.


1984 ◽  
Vol 21 (03) ◽  
pp. 616-627
Author(s):  
P. R. Parthasarathy ◽  
M. Sharafali
Keyword(s):  

In this paper we discuss the total service rendered by all the servers in certain loss systems.


Sign in / Sign up

Export Citation Format

Share Document