Advertisement

Instability in a Communication Network

Chapter
  • 390 Downloads

Abstract

The problems described here are concerned with a stochastic model of a communication network. The model represents the interactions between the random demands placed on a network, and the aim is to understand its stationary behavior. In particular, we are interested in any clues that the network may exhibit instabilities, with perhaps various distinct modes of behavior possible.

Keywords

Stationary Distribution Tree Network Markov Random Random Demand Call Attempt 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Ya. Kelbert and Yu. M. Suhov, “Conditions for Existence and Uniqueness of the Full Random Field Describing a State of a Switching Network,” Probl. Pered. Inform., 19, pp. 50–71 (1983).Google Scholar
  2. [2]
    F.P. Kelly, “Stochastic Models of Computer Communication Systems,” J. Roy. Statist. Soc., B47, pp. 379–395 (1985).Google Scholar
  3. [3]
    F.P. Kelly, “Blocking Probabilities in Large Circuit-Switched Networks,” Adv. Appl. Prob., 18, pp. 473–505 (1986).zbMATHCrossRefGoogle Scholar
  4. [4]
    R. Kinderman and J.L. Snell, “Markov Random Fields and Their Applications,” Contemporary Mathematics, Vol. I, American Mathematical Society, Providence, R.I., 1980.Google Scholar
  5. [5]
    T.M. Liggett, Interacting Particle Systems, Springer-Verlag, New York, 1985.zbMATHGoogle Scholar
  6. [6]
    V.V. Marbukh, “Asymptotic Investigation of a Complete Communications Network with a Large Number of Points and Bypass Routes,” Probl. Pered. Inform., 17, pp. 89–95 (1981).MathSciNetGoogle Scholar
  7. [7]
    F. Spitzer, “Markov Random Fields on an Infinite Tree,” Ann. Prob., 3, pp. 387–398 (1975).MathSciNetzbMATHCrossRefGoogle Scholar
  8. [8]
    Yu.M. Suhov, “Full Random Field Describing States of a Switching Network,” Fundamentals of Teletraffic Theory, Proceedings of the Third International Seminar on Teletraffic Theory, 1984. Institute for Problems of Information Transmission of the USSR Academy of Sciences, pp. 410–415.Google Scholar
  9. [9]
    I. Ziedins, “Quasi-Stationary Distributions and One-Dimensional Circuit-Switched Networks,” J. Appl. Prob., 23 (1986).Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1987

Authors and Affiliations

  1. 1.Statistical LaboratoryCambridge UniversityCambridgeGreat Britain

Personalised recommendations