Journal of Computer Science and Technology

, Volume 2, Issue 4, pp 243–264 | Cite as

Throughput models of CSMA network with stations uniformly distributed along the bus

  • S. T. Chanson
  • L. Liang
  • A. Kumar
Regular Papers


The distribution of station locations in a CSMA network can have significant effect on network throughput. In this paper, we develop an analytic model for unslotted, non-persistent CSMA bus network where the stations are uniformly distributed along the bus. We derive a closed form expression for throughput approximation, and discuss the fairness of CSMA protocol using the bus topology. Analytic and simulation results are presented and compared.


Propagation Delay Time Origin Busy Period Successful Transmission Vulnerable Area 
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]
    J.A. Field and J.W. Wong,A Carrier Sense Multiple Access (Collision Detection) System with Global Information, Proceedings of IEEE COMPCON’82, 511–520. Also available as CCNG Report E-95, University of Waterloo, May 1981.Google Scholar
  2. [2]
    J.L. Hammond and P.J.P. O’Reilly,Performance Analysis of Local Computer Networks, Addison-Wesley Publishing Company, 1986.Google Scholar
  3. [3]
    L. Kleinrock,Queueing Systems, Vol. 1 & 2, John Wiley and Sons, 1976.Google Scholar
  4. [4]
    L. Kleinrock and F.A. Tobagi,Packet Switching in Radio Channels: Part I Carrier Sense Multiple Access Modes and Their Throughput-Delay Characteristics, IEEE Transaction on Communications, Com-23: 12(1975), 1400–1416.MATHCrossRefGoogle Scholar
  5. [5]
    H. Kobayashi,Modeling and Analysis: An Introduction to System Performance Evaluation Methodology, Addison-Wesley Publishing Company, 1978.Google Scholar
  6. [6]
    A. Kumar and S. T. Chanson,The Effects of Station Location on Non-persistent CSMA Protocols, unpublished working paper, 1984.Google Scholar
  7. [7]
    S.S. Lam,A Carrier Sense Multiple Access Protocol for Local Networks, Computer Networks,4:1 (1980), 21–32.Google Scholar
  8. [8]
    R.M. Metcalfe and B.R. Boggs, “Ethernet: Distributed Packet Switching for Local Area Networks”,CACM,19: 7(1976), 395–404.Google Scholar
  9. [9]
    R. V. Hogg and A. T. Craig,Introduction to Mathematical Statistics, The Third Edition, The Macmillan Company, 1970.Google Scholar
  10. [10]
    S.M. Ross,Stochastic Processes, John Wiley & Sons, 1983.Google Scholar
  11. [11]
    M. Schwartz,Telecommunication Networks: Protocols, Modeling and Analysis, Addison-Wesley Publishing Company, 1987.Google Scholar
  12. [12]
    J.F. Shoch and J.A. Hupp,Measured Performance of an Ethernet Local Network, CACM,23: 12(1980), 711–721.Google Scholar
  13. [13]
    K. Sohraby, M.L. Molle and A.N. Venetsanopoulos,Why analytical Models of Ethernet-like Local Networks are so Pessimistic, Proceeding of IEEE GLOBECOM’84 659–664.Google Scholar
  14. [14]
    W. Stallings,Local Network Performance, IEEE Communication Magazine,22: 2(1984), 27–36.CrossRefGoogle Scholar
  15. [15]
    A. S. Tannenbaum.Computer Networks, Prentice-Hall, 1981.Google Scholar
  16. [16]
    J.W. Wong and S.S. Lam,Queuing Network Models of Packet Switching Networks, Part 1: Open Networks, Performance Evaluation 2(1982), 9–21.MATHCrossRefGoogle Scholar
  17. [17]
    J.W. Wong, J.P. Sauve and J.A. Field,A Study of Fairness in Packet-Switching Networks, IEEE Transaction on Communication, Com-30(1982), 346–353.MATHCrossRefGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1987

Authors and Affiliations

  • S. T. Chanson
    • 1
  • L. Liang
    • 1
  • A. Kumar
    • 1
  1. 1.Department of Computer ScienceThe University of British ColumbiaVancouverCanada

Personalised recommendations