Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-23T05:37:49.746Z Has data issue: false hasContentIssue false
  • English
  • Français

Pathological behaviour in loss networks

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

P. J. Hunt
P. J. Hunt*
Affiliation:
University of Cambridge
*
∗Present address: NatWest Markets, 135 Bishopsgate, London EC2M 3UR, UK.
Get access Rights & Permissions [Opens in a new window]

Abstract

Hunt and Kurtz [9] consider a loss network as the number of circuits and the offered traffics become large. They prove a functional law of large numbers for such a network and illustrate their results with some simple examples. In this paper we apply their results to slightly more complicated examples to illustrate other, and sometimes surprising, behaviour of the loss networks in heavy traffic. The networks we consider operate under somewhat unusual routing rules but this is to enable us to produce the behaviour in networks with only a few links. In larger, real-world networks it is likely that much more ‘natural' and intuitively appealing routing rules could produce similar undesirable behaviour.

Keywords

FUNCTIONAL LAW OF LARGE NUMBERSROUTING RULES

MSC classification

Primary: 60K25: Queueing theory
Type
Research Papers
Information
Journal of Applied Probability , Volume 32 , Issue 2 , June 1995 , pp. 519 - 533
Copyright
Copyright © Applied Probability Trust 1995 

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

Research supported by Christ's College, Cambridge.

References

[1] Ackerley, R. G. (1987) Hysteresis-type behaviour in networks with extensive overflow. Brit. Telecom Tech. J. 5.Google Scholar
[2] Akinpelu, J. M. (1984) The overload performance of engineered networks with non-hierarchical and hierarchical routing. Bell Syst. Tech. J. 63, 1261–1281.Google Scholar
[3] Billingsley, P. (1968) Convergence of Probability Measures. Wiley, New York.Google Scholar
[4] Costantini, C. (1991) Continuity properties of the Skorohod oblique reflection problem and existence of solutions. To appear.Google Scholar
[5] Ethier, S. N. and Kurtz, T. G. (1986) Markov Processes: Characterization and Convergence. Wiley, New York.CrossRefGoogle Scholar
[6] Fayolle, G. (1989) On random walks arising in queueing systems: ergodicity and transience via quadratic forms as Lyapounov functions-part I. QUESTA 5, 167–184.Google Scholar
[7] Gibbens, R. J., Hunt, P. J. and Kelly, F. P. (1990) Bistability in communication networks. In Disorder in Physical Systems, ed. Grimmett, G. R. and Welsh, D. J. A., pp. 113–128. Oxford University Press.Google Scholar
[8] Hersh, R. (1974) Random evolutions: a survey of results and problems. Rocky Mt. J. Math. 4, 443–477.Google Scholar
[9] Hunt, P. J. and Kurtz, T. G. (1992) Large loss networks. In preparation.Google Scholar
[10] Khas'Minskii, R. Z. (1966) On stochastic processes defined by differential equations with a small parameter. Theory Prob. Appl. 11, 211–228.Google Scholar
[11] Khas'Minskii, R. Z. (1966) A limit theorem for the solutions of differential equations with random right-hand sides. Theory Prob. Appl. 11, 390–406.Google Scholar
[12] Kurtz, T. G. (1989) Working paper on averaging and stochastic approximation. University of Wisconsin-Madison.Google Scholar
[13] Kushner, H. J. (1984) Approximation and Weak Convergence Methods for Random Processes. MIT Press, Cambridge, MA.Google Scholar
[14] Papanicolaou, G. C. (1978) Asymptotic analysis of stochastic equations. In Studies in Probability Theory, MAA Studies 18, ed. Rosenblatt, M., pp. 111–179. Mathematics Association of America, New York.Google Scholar
[15] Pinsky, M. A. (1974) Multiplicative operator functionals and their asymptotic properties. Advances in Probability 3.Google Scholar
[16] Whitt, W. (1985) Blocking when service is required from several facilities simultaneously. AT&T Tech. J. 64, 1807–1856.Google Scholar