The MVA priority approximation

A Mean Value Analysis (MVA) approximation is presented for computing the average performance measures of closed-, open-, and mixed-type multiclass queuing networks containing Preemptive Resume (PR) and nonpreemptive Head-Of-Line (HOL) priority service centers. The approximation has essentially the same storage and computational requirements as MVA, thus allowing computationally efficient solutions of large priority queuing networks. The accuracy of the MVA approximation is systematically investigated and presented. It is shown that the approximation can compute the average performance measures of priority networks to within an accuracy of 5 percent for a large range of network parameter values. Accuracy of the method is shown to be superior to that of Sevcik's shadow approximation.

[1]  Luke Y.-C. Lien,et al.  A tree convolution algorithm for the solution of queueing networks , 1983, CACM.

[2]  Benjamin Avi-Itzhak,et al.  Approximate Queuing Models for Multiprogramming Computer Systems , 1973, Oper. Res..

[3]  Simon S. Lam,et al.  A Tree Convolution Algorithm for Queueing Networks , 1981 .

[4]  K. Mani Chandy,et al.  HAM: The Heuristic Aggregation Method , 1982, SIGMETRICS.

[5]  Eugene Wong,et al.  The solution of separable queueing network models using mean value analysis , 1981, SIGMETRICS '81.

[6]  Alan Cobham,et al.  Priority Assignment in Waiting Line Problems , 1954, Oper. Res..

[7]  R. J. T. Morris,et al.  Priority queuing networks , 1981, The Bell System Technical Journal.

[8]  Anthony E. Krzesinski,et al.  The MVA Pre-empt resume priority approximation , 1983, SIGMETRICS '83.

[9]  G. Scott Graham,et al.  Guest Editor's Overview… Queuing Network Models of Computer System Performance , 1978, CSUR.

[10]  K. Mani Chandy,et al.  Approximate Analysis of Central Server Models , 1975, IBM J. Res. Dev..

[11]  N. K. Jaiswal,et al.  Priority queues , 1968 .

[12]  Pieter S. Kritzinger,et al.  A generalisation of Norton's theorem for multiclass queueing networks , 1982, Perform. Evaluation.

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

[14]  K. Mani Chandy,et al.  Parametric Analysis of Queuing Networks , 1975, IBM J. Res. Dev..

[15]  M. Reiser,et al.  A Queueing Network Analysis of Computer Communication Networks with Window Flow Control , 1979, IEEE Trans. Commun..

[16]  Stephen S. Lavenberg,et al.  Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers , 1980, Journal of Applied Probability.

[17]  Yonathan Bard,et al.  Some Extensions to Multiclass Queueing Network Analysis , 1979, Performance.

[18]  Martin Reiser,et al.  Interactive Modeling of Computer Systems , 1976, IBM Syst. J..

[19]  K. Mani Chandy,et al.  Computational algorithms for product form queueing networks , 1980 .

[20]  Hisashi Kobayashi,et al.  Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..

[21]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[22]  K. Mani Chandy,et al.  HAM: the heuristic aggregation method for solving general closed queueing network models of computer systems , 1982, SIGMETRICS '82.

[23]  K. Mani Chandy,et al.  Linearizer: a heuristic algorithm for queueing network models of computing systems , 1982, CACM.

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

[25]  Kenneth C. Sevcik,et al.  Priority Scheduling Disciplines in Queuing Network Models of Computer Systems , 1977, IFIP Congress.

[26]  Isi Mitrani,et al.  The Distribution of Queuing Network States at Input and Output Instants , 1979, JACM.