Equilibrium Point Analysis of a Slotted Ring
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.
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- R.M. Needham and A.J. Herbert. The Cambridge Distributed Computing System. Addison-Wesley, London, 1982.Google Scholar
- S. Tasaka. Performance Analysis of Multiple Access Protocols. MIT Press, Cambridge, Mass., 1986.Google Scholar