Equilibrium Point Analysis of a Slotted Ring

  • Michael E. Woodward
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


The access protocols for computer communication networks can, in principle, be modelled as multidimensional Markov chains. In most practical systems however, the state-space is so vast that a solution by classical Markov analysis is intractable, and some approximation technique must be used. In this paper the access protocol of a slotted ring network is modelled as a discrete-time Markov chain, and its solution is obtained by equilibrium point analysis (EPA), a method that approximates the stationary probability distribution of the Markov chain by a unit impulse located at a point in the state-space where the system is in equilibrium. The model is found to give good results over a wide range of parameter values when compared with an equivalent simulation study.


Markov Chain Slot Time Medium Access Control Protocol Buffer Overflow Unit Impulse 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    W. Bux. Local area subnetworks: A performance comparison. IEEE Transactions on Communications, COM-29(10):1465–1473,1981.CrossRefGoogle Scholar
  2. [2]
    R.M. Falconer and J.L. Adams. Orwell: A protocol for an integrated services local network. British Telecom Technology Journal, 3(4):27–35, 1985.Google Scholar
  3. [3]
    R.M. Falconer, J.L. Adams, and G.M. Whalley. A simulation study of the Cambridge ring with voice traffic. British Telecom Technology Journal, 3(2):85–91, 1985.Google Scholar
  4. [4]
    D.J. Farber and K.C. Larson. The system architecture of the distributed computer system. In J. Fox, editor, Computer Communications Networks and Tele-traffic, volume 22 of Microwave Research Institute Symposia, pages 21–27, New York, NY, 1972. Polytechnic Press.Google Scholar
  5. [5]
    G. Harrus. A model for the basic block protocol of the Cambridge ring. IEEE Transactions on Software Engineering, SE-11(1): 130–136,1985.CrossRefGoogle Scholar
  6. [6]
    A.R. Kamal and V.C. Hamacher. Approximate analysis of non-exhaustive multi-server polling systems with applications to local area networks. Computer Networks and ISDN Systems, 17(l):15–27, 1989.MATHCrossRefGoogle Scholar
  7. [7]
    P.J.B. King and I. Mitrani. Modelling a slotted ring local area network. IEEE Transactions on Computers, C-36(5):554–561,1987.CrossRefGoogle Scholar
  8. [8]
    J.D.C. Little. A proof of the queuing formula L = W. Operations Research, 9(3):383–387, 1961.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    R.M. Needham and A.J. Herbert. The Cambridge Distributed Computing System. Addison-Wesley, London, 1982.Google Scholar
  10. [10]
    J. Pierce. How far can data loops go? IEEE Transactions on Communications, COM-20(3):527–530,1972.CrossRefGoogle Scholar
  11. [11]
    S. Tasaka. Performance Analysis of Multiple Access Protocols. MIT Press, Cambridge, Mass., 1986.Google Scholar
  12. [12]
    M.E. Woodward. Equivalence of approximation techniques for solution of multidimensional Markov chains in network modelling. Electronics Letters, 27(12):1019–1021, 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London 1992

Authors and Affiliations

  • Michael E. Woodward
    • 1
  1. 1.Department of Electronic & Electrical EngineeringLoughborough University of TechnologyLoughborough, LeicsUK

Personalised recommendations