Analysis of multi-server two-stage queueing network with split and blocking Yang Woo Shin

2014 ◽  
Vol 47 (3) ◽  
pp. 1667-1671
Author(s):  
Dug Hee Moon
2018 ◽  
Vol 70 (2) ◽  
pp. 326-337
Author(s):  
Eman Almehdawe ◽  
Beth Jewkes ◽  
Qi-Ming He

2009 ◽  
Vol 198 (3) ◽  
pp. 859-866 ◽  
Author(s):  
Shaul K. Bar-Lev ◽  
Onno Boxma ◽  
Wolfgang Stadje ◽  
Frank A. Van der Duyn Schouten ◽  
Christoph Wiesmeyr

2016 ◽  
Vol 72 ◽  
pp. 1-11 ◽  
Author(s):  
F. Dong ◽  
J.R. Deglise-Hawkinson ◽  
M.P. Van Oyen ◽  
D.J. Singer

2013 ◽  
Vol 37 (6) ◽  
pp. 3736-3747
Author(s):  
Wenhui Zhou ◽  
Zhaotong Lian ◽  
Wei Xu ◽  
Weixiang Huang

2004 ◽  
Vol 36 (3) ◽  
pp. 893-918 ◽  
Author(s):  
Do Young Eun ◽  
Ness B. Shroff

We derive results that show the impact of aggregation in a queueing network. Our model consists of a two-stage queueing system where the first (upstream) queue serves many flows, of which a certain subset arrive at the second (downstream) queue. The downstream queue experiences arbitrary interfering traffic. In this setup, we prove that, as the number of flows being aggregated in the upstream queue increases, the overflow probability of the downstream queue converges uniformly in the buffer level to the overflow probability of a single queueing system obtained by simply removing the upstream queue in the original two-stage queueing system. We also provide the speed of convergence and show that it is at least exponentially fast. We then extend our results to non-i.i.d. traffic arrivals.


Sign in / Sign up

Export Citation Format

Share Document