Central Server Models with Multiple Job Classes, State Dependent Routing, and Rejection Blocking

Absfmcf-Central server models with multiple job classes, state dependent routing, and rejection blocking are investigated. The service time distributim may depend on the job class. Using the concepl of job lneal balance, we prove that the equilibrium state Probabilities of these networks have an exact product form w1utI~1. From the equilibrium state probabilities we dtduce formulas for the throughputs. An algorithm to compute performance measures, like the throughputs and the mean number of jobs is given. The complexity of the algorithm is discussed.

[1]  K. Mani Chandy,et al.  A Characterization of Product-Form Queuing Networks , 1983, JACM.

[2]  N M van Dijk,et al.  Insensitivity in two-node blocking models with applications , 1986 .

[3]  Ian F. Akyildiz,et al.  Exact Solutions for Open, Closed and Mixed Queueing Networks with Rejection Blocking , 1989, Theor. Comput. Sci..

[4]  Raif O. Onvural,et al.  Survey of closed queueing networks with blocking , 1990, CSUR.

[5]  Jeffrey P. Buzen,et al.  Queueing Network Models of Multiprogramming , 1971, Outstanding Dissertations in the Computer Sciences.

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

[7]  Boris G. Pittel,et al.  Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis , 1979, Math. Oper. Res..

[8]  Frank Kelly,et al.  Networks of queues with customers of different types , 1975, Journal of Applied Probability.

[9]  David D. Yao,et al.  Modeling a class of state-dependent routing in flexible manufacturing systems , 1985 .

[10]  Jeffrey R. Spirn.  Queuing Networks with Random Selection for Service , 1979, IEEE Transactions on Software Engineering.

[11]  Y. Dallery.  A queueing network model of flexible manufacturing systems consisting of cells , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[12]  Donald F. Towsley,et al.  Queuing Network Models with State-Dependent Routing , 1980, JACM.

[13]  Richard F. Serfozo,et al.  Markovian network processes: Congestion-dependent routing and processing , 1989, Queueing Syst. Theory Appl..

[14]  Donald F. Towsley,et al.  Product Form and Local Balance in Queueing Networks , 1977, JACM.

[15]  Andrew S. Noetzel.  A Generalized Queueing Discipline for Product Form Network Solutions , 1979, JACM.

[16]  Anthony E. Krzesinski.  Multiclass Queueing Networks with State-Dependent Routing , 1987, Perform. Evaluation.

[17]  A. Barbour.  Networks of queues and the method of stages , 1976, Advances in Applied Probability.

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

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

[20]  Ian F. Akyildiz,et al.  Queueing networks with blocking , 1987 .

[21]  Charles H. Sauer,et al.  Computational algorithms for state-dependent queueing networks , 1983, TOCS.

[22]  I. F. Akyildiz,et al.  Networks with mixed processor sharing parallel queues and common pools , 1988 .