论文信息 - Simple bounds for closed queueing networks

Simple bounds for closed queueing networks

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.

[1] P. G. Harrison,et al. Technical Note - On Normalizing Constants in Queueing Networks , 1985, Oper. Res..

[2] Jeffrey P. Buzen,et al. Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[3] W. Whitt,et al. Open and closed models for networks of queues , 1984, AT&T Bell Laboratories Technical Journal.

[4] I. G. MacDonald,et al. Symmetric functions and Hall polynomials , 1979 .

[5] Kin K. Leung,et al. Calculating normalization constants of closed queueing networks by numerically inverting their generating functions , 1995, JACM.

[6] Derek Livingston Eager. Bounding algorithms for queueing network models of computer systems , 1984 .

[7] I. Olkin,et al. Inequalities: Theory of Majorization and Its Applications , 1980 .

[8] J. J. Gordon,et al. The Evaluation of Normalizing Constants in Closed Queueing Networks , 1990, Oper. Res..

[9] Jie Wang,et al. Monte Carlo summation and integration applied to multiclass queuing networks , 1994, JACM.

[10] John Zahorjan,et al. Balanced job bound analysis of queueing networks , 1982, CACM.

[11] K. Mani Chandy,et al. Computer Systems Performance Modeling , 1981 .

[12] Yves Dallery. An improved balanced job bound analysis of closed queuing networks , 1987 .

[13] Stephen S. Lavenberg,et al. Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.