Performance Comparison of Local Area Network Architectures

  • Peter J. B. King
Conference paper
Part of the NATO ASI Series book series (volume 6)


There are two major styles of architecture for local area networks
  1. 1)

    Bus Networks;

  2. 2)

    Ring Networks.

which themselves are divided into several sub-classes within each major aivision. This paper briefly outlines models of the performance of Ethernet, Cambridge Ring and token ring architectures. The response time achievable using the different architectures is studiea both as a function of network length and as the rate of message submission increases.


Response Time Service Time Local Area Network Message Length Carrier Sense Multiple Access 
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.
    N. Abramson, “The ALOHA System,” in Computer Communication Networks, ed. N. Abramson and F.F. Kuo, Prentice-hall, Englewood Cliffs, N.J. (1973).Google Scholar
  2. 2.
    G.T. Almes ana E.D. Lazowska, “The behavior of Ethernet-like computer communications networks,” pp. 66–81 in Proceedings of 7th Symposium on Operating System Principles, Asilomar, California (1979).Google Scholar
  3. 3.
    W. Eux, “Local Area Subnetworks: A Performance Comparison,” IEEE Trans. Commun. Vol. COM-29(10), pp. 1465–73 (1981).Google Scholar
  4. 4.
    R.T. Carsten, “A Simplified Analysis of Scan Times in an Assymetrical Newhall Loop with Exhaustive Service,” IEEE Trans. Commun. Vol. COM-23(4), pp. 951–957 (1977).Google Scholar
  5. 5.
    R.T. Carsten ana M.J. Posner, “Simplified Statistical Models of Single and Multiple Newhall Loops,” National Telecomm. Conf., pp.44.5.1–44. 5. 7 (1978).Google Scholar
  6. 6.
    W.D. Farmer and E.E. Newhall, “An Experimental Switching System to hanale bursty Computer Traffic,” Proceedings ACM Symp. Problems Optimization of Data Communication Systems, pp. 1–34 (1969).Google Scholar
  7. 7.
    W.R. Franta ana I. Chlamtac, Local Networks, Lexington Books, Lexington, Mass. (19b1).Google Scholar
  8. 8.
    E. Gelenbe and I. Mitrani, “Control Policies in CSMA Local Area Networks: Ethernet Controls,” Performance Evaluation Review Vol. 11 (4), pp. 233–240 (1982).CrossRefGoogle Scholar
  9. 9.
    J.F. Hayes and D.N. Sherman, “Traffic Analysis of a Ring Switched Data Transmission System,” Bell Syst. Tech. Jour. Vol. 50 (9), Pp. 2947–2977 (1971).Google Scholar
  10. 10.
    S. Katz ana A.G. Konheim, “Priority Disciplines in a Loop System, ” Jour. Ass. Comput. Mach. Vol. 21 (2), pp. 340–349 (1974).CrossRefGoogle Scholar
  11. 11.
    P.J.E. King and I. Mitrani, “Modelling the Cambridge Ring,” Performance Evaluation Review Vol. 11 (4), pp. 250–258, Submitted to IEEE Trans Computers (1982).Google Scholar
  12. 12.
    P.J.E. King, I. Mitrani, and B. Plateau, Modelling a Token Ring Network, Submitted to Computer Networks, 1982.Google Scholar
  13. 13.
    L. Kleinrock, Queueing Systems Volume 2: Computer Applications, Wiley, New York (1976).MATHGoogle Scholar
  14. 14.
    A.G. Konheim, “Chaining in a Loop System,” IEEE Trans. Commun. Vol. COM-24(2), pp. 203–210 (1976).Google Scholar
  15. 15.
    A.G. Konheim and B. Meister, “waiting Lines ana Times in a System with Polling,” Jour. Ass. Comput. Mach. Vol. 21 (3), pp. 470–490 (1974).MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    S.S. Lam, “A Carrier Sense Multiple Access Protocol for Local Networks,” Computer Networks Vol. 4, pp.21–32 (19b0).Google Scholar
  17. 17.
    R.M. Metcalfe ana D.R. Boggs, “Ethernet: Distributed Packet Switching for Local Area Networks, ” Commun. Ass. Comput. Mach. Vol. 19 (7), pp. 395–404 (1976).Google Scholar
  18. 16.
    R. Neeaham, “Systems Aspects of the Cambridge Ring,” pp. 62–65 in Proceedings of 7th Symposium on Operating System Principles, Asilomar, California (1979).Google Scholar
  19. 19.
    J.R. Pierce, “Network for the Block Switching of Data,” Bell Syst. Tech. Jour. Vol. 51 (6) (1972).Google Scholar
  20. 20.
    K.C. Sevcik and I. Mitrani, “The Distribution of Queueing Network States at Input and Output Instants,” Jour. Ass. Comput. Mach. Vol. 26 (2), pp. 356–371 (1961).MathSciNetGoogle Scholar
  21. 21.
    F.A. Tobagi ana V.B. Hunt, “Performance Analysis of Carrier Sense Multiple Access with Collision Detection, ” Computer Networks Vol. 4, pp. 245–259 (1960).Google Scholar
  22. 22.
    C. Tropper, Local Computer Network Technologies, Academic Press, London (1961).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Peter J. B. King
    • 1
  1. 1.Department of Computer ScienceHeriot-Watt UniversityEdinburghUK

Personalised recommendations