Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-25T23:04:13.777Z Has data issue: false hasContentIssue false
  • English
  • Français

Overall station balance and decomposability for non-Markovian queueing networks

Part of: Operations research and management science Special processes

Published online by Cambridge University Press:  01 July 2016

D. Fakinos  and
A. Economou
D. Fakinos*
Affiliation:
University of Athens
A. Economou*
Affiliation:
University of Athens
*
∗ Postal address: Department of Mathematics, University of Athens, 157 84 Athens, Greece.
∗ Postal address: Department of Mathematics, University of Athens, 157 84 Athens, Greece.
Get access Rights & Permissions [Opens in a new window]

Abstract

Introducing the concept of overall station balance which extends the notion of station balance to non-Markovian queueing networks, several necessary and sufficient conditions are given for overall station balance to hold. Next the concept of decomposability is introduced and it is related to overall station balance. A particular case corresponding to a Jackson-type queueing network is considered in some more detail.

Keywords

Queueing networksstation balanceproduct form

MSC classification

Primary: 60K25: Queueing theory
Secondary: 60K30: Applications (congestion, allocation, storage, traffic, etc.) 90B22: Queues and service
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 30 , Issue 3 , September 1998 , pp. 870 - 887
Copyright
Copyright © Applied Probability Trust 1998 

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

Baskett, F., Chandy, M., Muntz, R. and Palacios, J. (1975). Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Comp. Mach. 22, 248–260.Google Scholar
Chandy, M., Howard, J. and Towsley, D. (1977). Product from and local balance in queueing networks. J. Assoc. Comp. Mach. 24, 250–263 Google Scholar
Chandy, M. and Martin, J. (1983). A characterization of product form queueing networks. J. Assoc. Comp. Mach. 30, 286–299 CrossRefGoogle Scholar
Hordijk, A. and Van Dijk, N. M. (1982). Stationary probabilities for networks of queues. In Applied Probability–Computer Science, Vol. II, The Interface, ed. Disney, R. L. and Ott, T. J.. Birkhauser, Boston, pp. 423–451.Google Scholar
Jackson, J.R. (1957). Networks of waiting lines. Operat. Res. 5, 518–521.Google Scholar
Jackson, J.R. (1963). Jobshop-like queueing systems. Management Sci. 10, 131–142.Google Scholar
Kelly, F. P. (1975). Networks of queues with customers of different types. J. Appl. Prob. 12, 542–554 CrossRefGoogle Scholar
Kelly, F. P. (1976). Networks of queues. Adv. Appl. Prob. 8, 416–432 Google Scholar
Kelly, F. P. (1979). Reversibility and Stochastic Networks. Wiley, New York.Google Scholar
Van Dijk, N. M. (1993). Queueing Networks and Product Forms: A System Approach. Wiley, Chichester.Google Scholar
Walrand, J. (1988). An Introduction to Queueing Networks. Prentice-Hall, Englewood Cliffs, NJ.Google Scholar
Whittle, P. (1968). Equilibrium distributions for an open migration process. J. Appl. Prob. 5, 567–571.Google Scholar