An improved balanced job bound analysis of closed queuing networks

Authors:
Yves Dallery
Affiliations:
Laboratoire d'Automatique de Grenoble (L.A.G.), C.N.R.S. U.A. no. 228, E.N.S.I.E.G.-I.N.P.G., B.P. 46, 38402 Saint-Martin-d'Heres, France
Venue:
Operations Research Letters
Year:
1987

Citing 10
Cited 0

Bound hierarchies for multiple-class queuing networks

Journal of the ACM (JACM) - The MIT Press scientific computation series
The composite bound method for computing throughout bounds in multiple class environments

Performance Evaluation
Approximate disaggregation and performance bounds for queueing networks with multiple-server stations

SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

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

Journal of the ACM (JACM)
The Operational Analysis of Queueing Network Models

ACM Computing Surveys (CSUR)
Performance bound hierarchies for queueing networks

ACM Transactions on Computer Systems (TOCS)
Balanced job bound analysis of queueing networks

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

Communications of the ACM
Convolutional bound hierarchies

SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Balanced job bounds (BJB) is a technique for obtaining lower and upper bounds on the throughput of a separable closed queuing network. The conceptual simplicity and the low computational complexity of this technique make these bounds very attractive. However, whereas the lower bound is usually quite good, the upper bound may be loose. In this paper, we present an improved BJB analysis for obtaining a tight upper bound.