An accurate performance model of CSMA/CD bus LAN

  • M. Ajmone Marsan
  • G. Chiola
  • A. Fumagalli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 266)


Petri net models in which transitions can be associated with either deterministic or exponentially distributed firing times are developed to investigate the performance of a local area network with a linear topology in which a single bus is accessed by a finite population of stations randomly located along the bus using the 1-persistent CSMA/CD protocol. A detailed model is first constructed, mainly for specification purposes. Indeed, from such a model results can be obtained only through simulation. A compact, analytically tractable model is then developed, and it is validated by comparing its results with those obtained from the detailed model by simulation. Some performance curves show that the proposed compact model can be used to obtain accurate performance estimates in the considered case, which had previously been considered intractable.


Average Packet Delay Deterministic Transition Exponential Transition Firing Delay Triangular Probability Distribution 
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.
    L. Kleinrock and F.A. Tobagi, “Packet Switching in Radio Channels: Part 1-Carrier Sense Multiple Access Modes and their Throughput-Delay Characteristics,” IEEE Transactions on Communications COM-23(12) pp. 1400–1416 (December 1975).Google Scholar
  2. 2.
    Digital, Intel, and Xerox, The Ethernet, a Local Area Network. Data Link Layer and Physical Layer Specification. Version 2.0. November 1982.Google Scholar
  3. 3.
    M. Ajmone Marsan and P. Camarda, “The Effect of Acknowledgement Traffic on the Performance of Multichannel CSMA-CD Protocols,” in proc. INFOCOM 85,, Washington, DC (March 1985).Google Scholar
  4. 4.
    F.A. Tobagi and V.B. Hunt, “Performance Analysis of Carrier Sense Multiple Access with Collision Detection,” Computer Networks 4(5) pp. 245–259 (October/November 1980).Google Scholar
  5. 5.
    H. Takagi and L. Kleinrock, “Throughput Analysis for Persistent CSMA Systems,” IEEE Transactions on Communications COM-33(7) pp. 627–638 (July 1985).Google Scholar
  6. 6.
    K. Sohraby, M.L. Molle, and A.N. Venetsanopoulos, “Why Analytical Models of Ethernet-Like Local Networks are so Pessimistic,” in proc. GLOBECOM 84, (1984).Google Scholar
  7. 7.
    A.A.S. Danthine, “Protocol Representation with Finite-State Models,” IEEE Transactions on Communications COM-28(4) pp. 632–643 (April 1980).Google Scholar
  8. 8.
    M. Diaz, “Modeling and Analysis of Communication and Cooperation Protocols Using Petri Net Based Models,” Computer Networks 6 pp. 419–441 (December 1982).CrossRefGoogle Scholar
  9. 9.
    E. Gressier, “A Stochastic Petri Net Model for Ethernet,” in proc. Int. Workshop on Timed Petri Nets, IEEE, Torino, Italy (July 1985).Google Scholar
  10. 10.
    Proceedings of the International Workshop on Timed Petri Nets, IEEE CS press, Torino, Italy (July 1985).Google Scholar
  11. 11.
    M. Ajmone Marsan and G. Chiola, “On Petri Nets with Deterministic and Exponentially Distributed Firing Times,” in this volume Google Scholar
  12. 12.
    G. Chiola, “A Software Package for the Analysis of Generalized Stochastic Petri Net Models,” in proc. Int. Workshop on Timed Petri Nets, IEEE, Torino, Italy (July 1985).Google Scholar
  13. 13.
    G. Chiola, “A Graphical Petri Net Tool for Performance Analysis,” in proc. 3 rd Int. Workshop on Modeling Techniques and Performance Evaluation, AFCET, Paris, France (March 1987).Google Scholar
  14. 14.
    J.D.C. Little, “A Proof of the Queueing Formula L = λ W,” Operations Research 9 pp. 383–387 (1961).Google Scholar
  15. 15.
    M. Ajmone Marsan, G. Balbo, and G. Conte, “A Class of Generalized Stochastic Petri Nets for the Performance Analysis of Multiprocessor Systems,” ACM TOCS 2(2) pp. 93–122 (May 1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • M. Ajmone Marsan
    • 1
  • G. Chiola
    • 2
  • A. Fumagalli
    • 1
  1. 1.Dipartimento di ElettronicaPolitecnico di TorinoItaly
  2. 2.Dipartimento di InformaticaUniversita di TorinoItaly

Personalised recommendations