Simple bounds for closed queueing networks

Authors:
Arie Harel;Su Namn;Jacob Sturm
Affiliations:
Department of Mathematics, National University of Singapore, Lower Kent Ridge Road, Singapore 119260 E-mail: harel@math.nus.edu.sg;Department of Management Information Systems, Hannam University, Taeduk-Gu, Taejon, Korea E-mail: namn@eve.hannam.ac.kr;Department of Mathematics and Computer Science, Rutgers University, Newark, NJ 07102, USA E-mail: sturm@andromeda.rutgers.edu
Venue:
Queueing Systems: Theory and Applications
Year:
1999

Citing 7
Cited 1

The evaluation of normalizing constants in closed queueing networks

Operations Research
Monte Carlo summation and integration applied to multiclass queuing networks

Journal of the ACM (JACM)
Calculating normalization constants of closed queueing networks by numerically inverting their generating functions

Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks

Journal of the ACM (JACM)
Balanced job bound analysis of queueing networks

Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers

Communications of the ACM
Bounding algorithms for queueing network models of computer systems

Bounding algorithms for queueing network models of computer systems

Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks

Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider a closed Jackson type network in which each queue has a single exponential server. Assume that N customers are moving among k queues. We establish simple closed form bounds on the network throughput (both lower and upper), which are sharper than those that are currently available. Numerical evaluation indicates that the improvements are significant.