Skip to main content
SpringerLink
Log in

Performance Analysis of Buffered CSMA/CD Systems

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

This paper presents a new approximation approach, called tagged user approach (TUA), for the queueing analysis of slotted CSMA/CD systems with a finite user population having either finite or infinite user buffer capacity. By assuming a symmetric channel, the performance analysis of the overall system is determined by the performance of an arbitrarily selected user, called the tagged user. With the further assumption that each user always operates with its equilibrium probability, the packet service time distribution can be obtained using a state flow graph by studying the channel contention scheme. The obtained packet service time distribution is then applied to the queueing analysis of the tagged user using the standard queueing theory. That is, the analysis of the channel contention scheme and the analysis of the user queueing behavior are decoupled in this paper. Hence, TUA can be applied to complicated systems such as those where each user buffer may have bulk packet arrivals and random service discipline as long as the corresponding queueing theory is available. Since a state transition probability matrix is not required in TUA, the required amount of computation is quite small. Simulation results verify the high accuracy of the analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Man-Keung Lo and Tak-Shing P. Yum, “The Tone Sense Multiaccess Protocol with Partial Collision Detection (TSMA/PCD) for Packet Satellite Communications”, IEEE Trans. Comm., Vol. 41, pp. 820–824, 1993.

    Google Scholar 

  2. CDPD Forum Inc., Cellular Digital Packet Data System Specification: Release 1.1, 19 January 1995.

  3. F.A. Tobagi and V.B. Hunt, “Performance Analysis of Carrier Sense Multiple Access with Collision Detection”, Computer Networks, Vol. 4, pp. 245–259, 1980.

    Google Scholar 

  4. E.D. Sykas, D.E. Karvelas and E.N. Protonotarios, “Queueing Analysis of Some Buffered Random Multiple Access Schemes”, IEEE Trans. on Comm., Vol. COM-34, No. 8, pp. 790–798, 1986.

    Google Scholar 

  5. A.O. Fapojuwo, W.C. Chan and D. Irvine-Halliday, “An Iterative Approximation for Modelling Buffered CSMA-CD LAN's, Journal of Electrical and Electronics Engineering, Vol. 8, No. 2, pp. 102–111, 1988.

    Google Scholar 

  6. S. Tasaka, Performance Analysis of Multiple Access Protocols, The MIT Press, 1986.

  7. S. Tasaka, “Dynamic Behavior of a CSMA-CD System with a Finite Population of Buffered Users”, IEEE Trans. on Comm., Vol. COM-34, No. 6, pp. 576–586, 1986.

    Google Scholar 

  8. T.K. Apostolopoulos and E.N. Protonotarios, “Queueing Analysis of Buffered CSMA/CD Protocols”, IEEE Trans. on Comm., Vol. COM-34, pp. 898–905, 1986.

    Google Scholar 

  9. A. Ganz and I. Chlamtac, “A Linear Solution to Queueing Analysis of Synchronous Finite Buffer Networks”, IEEE Trans. on Comm., Vol. 38, pp. 440–447, 1990.

    Google Scholar 

  10. A. Ganz and I. Chlamtac, “An Efficient Solution to Finite Buffer Non-Persistent Carrier Sense Multiple Access Protocol”, Computer Networks and ISDN Systems, Vol. 18, pp. 263–274, 1989/90.

    Google Scholar 

  11. J. Silvester and I. Lee, “Performance Modeling of Buffered CSMA–an Iterative Approach”, Globecom '82, pp. 1195–1199, 1982.

  12. T.K. Apostolopoulos and E.N. Protonotarios, “Queueing Analysis of Buffered Slotted Multiple Access Protocols”, Comput. Commun., Vol. 8, pp. 9–21, 1985.

    Google Scholar 

  13. H. Takagi, Queueing Analysis–A Foundation of Performance Evaluation, Vol. 3: Discrete-Time Systems, North-Holland Publishing Company, 1993.

  14. H.H. Tan and K. Tsai, “Packet Output Processes of CSMA and CSMA/CD Protocols”, IEEE Trans. on Comm., Vol. 44, pp. 464–474, 1996.

    Google Scholar 

  15. Y. Matsumoto, Y. Takahashi and T. Hasegawa, “The Effects of Packet Size Distributions on Output and Delay Processes of CSMA/CD”, IEEE Trans. on Comm., Vol. 38, pp. 199–214, 1990.

    Google Scholar 

  16. S.L. Beuerman and E.J. Coyle, “The Delay Characteristics of CSMA/CD Networks”, IEEE Trans. on Comm., Vol. 36, pp. 553–563, 1988.

    Google Scholar 

  17. T. Takine, Y. Takahashi and T. Hasegawa, “An Approximate Analysis of a Buffered CSMA/CD”, IEEE Trans. on Comm., Vol. 36, pp. 932–941, 1988.

    Google Scholar 

  18. Y. Matsumoto, Y. Takahashi and T. Hasegawa, “Probability Distributions of Interdeparture Time and Response Time in Multipacket CSMA/CD Systems”, IEEE Trans. on Commun., Vol. 38, pp. 54–66, 1990.

    Google Scholar 

  19. R.A. Howard, Dynamic Probabilistic Systems, Volume II: Semi-Markov and Decision Processes, John Wiley & Sons, 1971.

  20. W.A. Wolovich, Automatic Control Systems: Basic Analysis and Design, Saunders College Publishing, 1994.

Download references

Author information

Authors and Affiliations

  1. Nortel Networks, Richardson, TX, U.S.A

    Tao Wan

  2. Department of Electrical Engineering, King Fahd University of Petroleum and Minerals, Dhahran, 31261, Saudi Arabia

    Asrar U. Sheikh

Authors
  1. Tao Wan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Asrar U. Sheikh
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wan, T., Sheikh, A.U. Performance Analysis of Buffered CSMA/CD Systems. Wireless Personal Communications 18, 45–65 (2001). https://doi.org/10.1023/A:1011247909837

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011247909837

Search

Navigation