Solving general multi-class closed queuing networks using parametric decomposition

2013 ◽  
Vol 40 (7) ◽  
pp. 1777-1789 ◽  
Author(s):  
Kumar Satyam ◽  
Ananth Krishnamurthy ◽  
Manjunath Kamath
Keyword(s):  
Queuing Networks ◽  
Parametric Decomposition ◽  
Closed Queuing Networks

Realization probability and throughput sensitivity in a closed jackson network

1989 ◽  
Vol 26 (03) ◽  
pp. 615-624
Author(s):  
Xi-Ren Cao
Keyword(s):  
Perturbation Analysis ◽  
Queuing Networks ◽  
Single Class ◽  
Jackson Network ◽  
State Dependent ◽  
Closed Queuing Networks ◽  
Service Rates

Realization probability is a new concept pertaining to perturbation analysis of closed queuing networks. The sensitivities of throughputs in a closed single-class Jackson network can be expressed in terms of realization probabilities. In this paper, based on a discussion of perturbation analysis for networks with state-dependent service rates, we derive some new formulas for sensitivities of throughputs using realization probability.

Optimal routing in closed queuing networks

1983 ◽  
Vol 1 (4) ◽  
pp. 294-310 ◽  
Author(s):  
Hiroshi Kobayashi ◽  
Mario Gerla
Keyword(s):  
Optimal Routing ◽  
Queuing Networks ◽  
Closed Queuing Networks

Modeling server-unreliability in closed queuing-networks

1989 ◽  
Vol 38 (1) ◽  
pp. 90-95 ◽  
Author(s):  
C.S. Ramanjaneyulu ◽  
V.V.S. Sarma
Keyword(s):  
Queuing Networks ◽  
Closed Queuing Networks
Sign in / Sign up

Export Citation Format

Share Document