Hostname: page-component-cb9f654ff-rkzlw Total loading time: 0 Render date: 2025-08-31T10:18:37.825Z Has data issue: false hasContentIssue false
  • English
  • Français

Poisson approximations for telecommunications networks

Published online by Cambridge University Press:  17 February 2009

T. C. Brown  and
P. K. Pollett
T. C. Brown
Affiliation:
Department of Mathematics, The University of Western Australia, W.A. 6009.
P. K. Pollett
Affiliation:
Department of Mathematics, The University of Queensland, Qld. 4072.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper, we review some techniques for studying traffic processes in telecommunications networks. The first of these allows one to identify Poisson traffic via the notion of “deterministic past-conditional arrival rate”. Our approach leads to a method by which one can assess the degree of deviation of traffic processes from Poisson processes. We explain how this can be used to delimit circumstances under which traffic is approximately Poissonian.

Information

Type
Research Article
Information
The ANZIAM Journal , Volume 32 , Issue 3 , January 1991 , pp. 348 - 364
Copyright
Copyright © Australian Mathematical Society 1991

References

[1]Barbour, A. D. and Hall, P., “On the rate of Poisson convergence”, Math. Proc. Cam. Phil. Soc. 95 (1984) 473–480.CrossRefGoogle Scholar
[2]Brémaud, , Point processes and queues, martingale dynamics, (Springer-Verlag, New York, 1981).CrossRefGoogle Scholar
[3]Brown, T. C., The Doob-Meyer decomposition and stochastic calculus, Research Report 1988/1984, Department of Mathematics, The University of Western Australia.Google Scholar
[4]Brown, T. C. and Pollett, P. K., “Some distributional approximations in Markovian queueing networks”, Adv. Appl. Prob. 14 (1982) 654–671.CrossRefGoogle Scholar
[5]Kelly, F. P., “Networks of queues with customers of different types”, J. Appl. Probab. 12 (1975) 542–554.CrossRefGoogle Scholar
[6]Kelly, F. P., Reversibility and stochastic networks, (Wiley, New York, 1979).Google Scholar
[7]Leon-Garcia, A., Probability and random processes for electrical engineering, (Addison Wesley, London, 1989).Google Scholar
[8]Melamed, B., “Characterization of Poisson traffic streams in Jackson queueing networks”, Adv. Appl. Prob. 11 (1979) 422–438.CrossRefGoogle Scholar
[9]Pollett, P. K., “Distributional approximations for networks of quasireversible queues”, in Stochastic analysis and applications. Lecture notes in mathematics no. 1095 (eds. Williams, D. and Truman, A.), (Springer-Verlag, Berlin, 1984).Google Scholar
[10]Pollett, P. K., “Analysis of response times and optimal allocation of resources in message and packet switched networks”, Asia-Pacific J. Open. Res. 3 (1986) 134–149.Google Scholar
[11]Ziedins, I. B. and Kelly, F. P., “Limit theorems for loss networks with diverse routing”, Adv. Appl Probab. 21 (1989) 804–830.CrossRefGoogle Scholar