Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-23T18:36:32.479Z Has data issue: false hasContentIssue false
  • English
  • Français

On First-Come First-Served Versus Random Service Discipline in Multiclass Closed Queueing Networks

Published online by Cambridge University Press:  27 July 2009

Ronald Buitenhek ,
Geert-Jan van Houtum  and
Jan-Kees van Ommeren
Ronald Buitenhek
Affiliation:
Faculty of Mechanical Engineering, University of Twente, 7500 AE Enschede, The Netherlands
Geert-Jan van Houtum
Affiliation:
Faculty of Mechanical Engineering, University of Twente, 7500 AE Enschede, The Netherlands
Jan-Kees van Ommeren
Affiliation:
Faculty of Applied Mathematics, University of Twente, 7500 AE Enschede, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider multiclass closed queueing networks. For these networks, a lot of work has been devoted to characterizing and weakening the conditions under which a product-form solution is obtained for the steady-state distribution. From this work, it is known that, under certain conditions, all networks in which each of the stations has either the first-come first-served or the random service discipline lead to the same (product-form expressions for the) steady-state probabilities of the (aggregated) states that for each station and each job class denote the number of jobs in service and the number of jobs in the queue. As a consequence, all these situations also lead to the same throughputs for the different job classes. One of the conditions under which these equivalence results hold states that at each station all job classes must have the same exponential service time distribution. In this paper, it is shown that these equivalence results can be extended to the case with different exponential service times for jobs of different classes, if the network consists of only one single-server or multiserver station. This extension can be made despite of the fact that the network is not a product-form network anymore in that case. The proof is based on the reversibility of the Markov process that is obtained under the random service discipline. By means of a counterexample, it is shown that the extension cannot be made for closed network with two or more stations.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 11 , Issue 3 , July 1997 , pp. 313 - 326
Copyright
Copyright © Cambridge University Press 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Baskett, F., Chandy, K.M., Muntz, R.R., & Palacios, F.G. (1975). Open, closed, and mixed networks of queues with different classes of customers. Journal of the Association for Computing Machines 22: 248–260.CrossRefGoogle Scholar
2.Baynat, B. & Dallery, Y. (1996). A product-form approximation method for general closed queueing networks with several classes of customers. Performance Evaluation 24: 165–188.CrossRefGoogle Scholar
3.Buitenhek, R., van Houtum, G.J., & Zijm, W.H.M. (1995). A queueing model for a dual resource production problem. Working Paper LPOM–95–17, Faculty of Mechanical Engineering, University of Twente, Enschede, The Netherlands.Google Scholar
4.Kelly, F.P. (1975). Networks of queues with customers of different types. Journal of Applied Probability 12: 542–554.CrossRefGoogle Scholar
5.Kelly, F.P. (1979). Reversibility and stochastic networks. New York: Wiley.Google Scholar
6.Marie, R. & Rubino, G. (1986). An approximation for a multiclass ./M/FIFO queue imbedded in a closed queueing network. Journal of Systems Software 1: 31–39.CrossRefGoogle Scholar
7.Spirn, J.R. (1979). Queueing networks with random selection for service. IEEE Transactions on Software Engineering 5: 287–289.CrossRefGoogle Scholar