Performance models of token ring local area networks

ABSTRACT

This paper presents a simple heuristic analytic algorithm for predicting the “response times” of messages in asymmetric token ring local area networks. A description of the token ring and the model is presented in section 2 the algorithm is described in section 3 and the empirical results in section 4. The analytic results were compared against a detailed simulation model and the results are extremely close over a wide range of models. Local area networks (or LANS) offer a very attractive solution to the problem of connecting a large number of devices distributed over a small geographic area. They are an inexpensive readily expandable and highly flexible communications media. They are the backbone of the automated office - a significant component of the office of the future. This importance of LANS in the future of applied computer science has resulted in a tremendous burst of interest in the study of their behaviour. There are already many different LAN architectures proposed and studied in the literature [Tropper 81] [Tannenbaum 81] [Babic 78] [Metcalfe 76] [Clark 78] One LAN architecture is significant for several reasons. This architecture is the token ring [Carsten 77]. It has attracted interest because of its simplicity fairness and efficiency. The interest it has generated has resulted in the proposal of several different versions. This paper concentrates on one of these versions - the single token token ring protocol as described in [Bux 81]. This particular version is attractive because of its overall simplicity and reliability. This paper presents an algorithm for predicting response times in a token ring with the single token protocol.

REFERENCES

• 1: Gojko A. Babic, Performance analysis of the distributed loop computer network., 1978
• 2: Bux, Werner. Local-Area Subnetworks: A Performance Comparison. IEEE Trans. on Comm (10):1465-1473, October, 1981.
• 3: Carsten, Ralph T., et. al. A Simplified Analysis of Scan Times In an Asymmetrical Newhall Loop with Exhaustive Service. IEEE Trans. on Comm (9.):951-957, September, 1977.
• 4: Carsten, Ralph T. and Posner, M.J. Simplified Statistical Models of Single and Multiple Newhall Loops. Proceedings of the National Telecomm. Conf.: 44.5.1-44.5.7, 1978.
• 5: K. Mani Chandy , Doug Neuse, Linearizer: a heuristic algorithm for queueing network models of computing systems, Communications of the ACM, v.25 n.2, p.126-134, Feb 1982 [doi>10.1145/358396.358403]
• 6: Clark, David D., et. al. An Introduction to Local Area Networks. Proceedings of the IEEE 66(11):1497-1517, November, 1978.
• 7: Leonard Kleinrock, Theory, Volume 1, Queueing Systems, Wiley-Interscience, 1975
• 8: Alan G. Konheim , Bernd Meister, Waiting Lines and Times in a System with Polling, Journal of the ACM (JACM), v.21 n.3, p.470-490, July 1974 [doi>10.1145/321832.321845]
• 9: Kuehn, P.J. Multiqueue Systems with Nonexhaustive Cyclic Service. Bell Systems Technical Journal 58(3):671-698, March, 1979.
• 10: Little, J. D. C. A Proof of the Queueing Formula L&equil;&lgr;W. Operations Research 9:383-387, 1961.
• 11: Robert M. Metcalfe , David R. Boggs, Ethernet: distributed packet switching for local computer networks, Communications of the ACM, v.19 n.7, p.395-404, July 1976 [doi>10.1145/360248.360253]
• 12: A. S. Tanenbaum, Computer networks, Prentice-Hall, Inc., Upper Saddle River, NJ, 1988
• 13: Carl Tropper, Local Computer Network Technologies, Academic Press, Inc., Orlando, FL, 1981

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.5 Local and Wide-Area Networks
          Subjects: Token rings

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.5 Local and Wide-Area Networks
  C.4 PERFORMANCE OF SYSTEMS

General Terms:
Performance