Hostname: page-component-84b7d79bbc-x5cpj Total loading time: 0 Render date: 2024-07-31T09:11:01.930Z Has data issue: false hasContentIssue false
  • English
  • Français

Some distributional approximations in Markovian queueing networks

Published online by Cambridge University Press:  01 July 2016

T. C. Brown  and
P. K. Pollett
T. C. Brown
Affiliation:
University of Bath
P. K. Pollett*
Affiliation:
University of Cambridge
*
∗∗Postal address: Statistical Laboratory, 16 Mill Lane, Cambridge CB2 1SB, U.K.
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider single-class Markovian queueing networks with state-dependent service rates (the immigration processes of Whittle (1968)). The distance of customer flows from Poisson processes is estimated in both the open and closed cases. The bounds on distances lead to simple criteria for good Poisson approximations. Using the bounds, we give an asymptotic, closed network version of the ‘loop criterion' of Melamed (1979) for an open network. Approximation of two or more flows by independent Poisson processes is also studied.

Keywords

QUEUEING NETWORKSMIGRATION PROCESSPOISSON APPROXIMATIONSBOTTLENECKSLOOP CRITERIA
Type
Research Article
Information
Advances in Applied Probability , Volume 14 , Issue 3 , September 1982 , pp. 654 - 671
Copyright
Copyright © Applied Probability Trust 1982 

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.)

Footnotes

a

Present address: Mathematics Department, Monash University, Clayton, VIC 3168, Australia.

References

Aalen, O. O. (1978) Non-parametric inference for a family of counting processes. Ann. Statist. 6, 701–726.Google Scholar
Billingsley, P. (1968) Convergence of Probability Measures. Wiley, New York.Google Scholar
Brown, T. C. (1982) Some Poisson approximations. Statistics Research Report, Department of Mathematics, Monash University.Google Scholar
Feller, W. (1968) An Introduction to Probability Theory and its Applications, Vol. 1, 3rd edn. Wiley, New York.Google Scholar
Fichtner, K. H. (1975a) Charakterisierung Poissonscher zufälliger Punktfolgen und infinitesemale Verdünnungsschemata. Math. Nachr. 68, 93–104.Google Scholar
Fichtner, K. H. (1975b) Schwache Konvergenz von unabhängigen überlagerungen verdünnter zufälliger Punktfolgen. Math. Nachr. 66, 333–341.Google Scholar
Kelly, F. P. (1979) Reversibility and Stochastic Networks. Wiley, New York.Google Scholar
Melamed, B. (1979) Characterizations of Poisson traffic streams in Jackson queueing networks. Adv. Appl. Prob. 11, 422–438.Google Scholar
Walrand, J. (1982) Poisson flows in single class open networks of quasi reversible queues. Stoch. Proc. Appl. Google Scholar
Walrand, J. and Varaiya, P. (1981) Flows in queueing networks: A martingale approach. Math. Operat. Res. 6, 387–404.Google Scholar
Whittle, P. (1968) Equilibrium distributions for an open migration process. J. Appl. Prob. 5, 567–571.Google Scholar