Abstract
A CSMA/CD local area network consists of a single server (the channel) and multiple interacting queues of message packets. The message queueing process in a buffered,p-persistent CSMA/CD system is modeled as a multidimensional semi-Markov chain. An effective approximation method to compute the mean packet delay in equilibrium is developed, based on an exact joint probability generating function of the queue length vector at embedded Markov epochs. We also develop a simulation model to validate approximation results. To the best of our knowledge, this work is the first in the literature that enables optimization of the control parameterp for the CSMA/CD system with more than two users.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T.K. Apostolopoulos and E.N. Protonotarios, Queueing analysis of buffered CSMA/CD protocols, IEEE Trans. Commun. COM-34(1986)898–905.
P. Billingsley,Probability and Measure (Wiley, New York, 1979).
W. Feller,An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed. (Wiley, New York, 1968).
J. Goodman, A.G. Greenberg, N. Madras and P. March, Stability of binary exponential backoff, J. ACM 35(1988)579–602.
J. Hastad, T. Leighton and B. Rogoff, Analysis of backoff protocols for multiple access channels,Proc. ACM Symp. on Theory of Computing (1987), pp. 241–253.
IEEE, Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications, ANSI/IEEE Std 802.3 (1985).
L. Kleinrock,Queueing Systems, Vol. 1:Theory (Wiley, New York, 1975).
L. Kleinrock and Y. Yemini, Interfering queueing processes in packet-switched broadcast communication,Proc. IFIP Congress (1980), pp. 557–562.
S.S. Lam, A carrier sense multiple access protocol for local networks, Comput. Networks 4(1980)21–32.
B. Lin and E.S. Sousa, A modified CSMA-CD protocol for high speed channels,Proc. IEEE INFOCOM (1990), pp. 253–259.
J.D.C. Little, A proof for the queueing formulaL = λW, Oper. Res. 9(1961)383–387.
N.F. Maxemchuk, Twelve random access strategies for fiber optic networks, IEEE Trans. Commun. COM-36(1988)942–950.
R.M. Metcalfe and D.R. Boggs, Ethernet: Distributed packet switching for local computer networks, Commun. ACM 19(1976)395–404.
B. Mukherjee and J.S. Meditch, Thep i -persistent protocol for undirectional broadcast bus network, IEEE Trans. Commun. COM-36(1988)1277–1286.
J.S. Park and R. Bartoszyński, Queueing analysis for buffered persistent CSMA local networks, Infor (Inform. Syst. Oper. Res.) 28(1990)190–200.
J.S. Park and R. Bartoszyński, Stability ofp-persistent CSMA/CD, Working Paper, College of Business Administration, The University of Iowa (1992).
A.A.B. Pritsker,Introduction to Simulation and SLAM II, 2nd ed. (Halsted Press, New York, 1984).
T.W. Saasawi and A. Ephremides, Analysis, stability and optimization of slotted ALOHA with a finite number of buffered users, IEEE Trans. Auto. Contr. AC-26(1981)680–689.
L. Schruben and D. Goldsman, Initialization effects in computer simulation experiments, Technical Report No. 594, School of OR and IE, Cornell University, Ithaca, NY (1985).
M. Sidi and A. Segall, Two interfering queues in packet-radio networks, IEEE Trans. Commun. COM-31(1983)123–129.
W. Szpankowski, Stability conditions for multidimensional queueing systems with computer applications, Oper. Res. 36(1988)944–957.
W. Stallings,Local Networks (MacMillan, New York, 1987).
H. Takagi and L. Kleinrock, Throughput analysis for persistent CSMA systems, IEEE Trans. Commun. COM-33(1985)627–638.
H. Takagi and L. Kleinrock, Mean packet queueing delay in a buffered two-user CSMA/CD system, IEEE Trans. Commun. COM-33(1985)1136–1139.
S. Tasaka, Dynamic behavior of a CSMA-CD system with a finite population of buffered users, IEEE Trans. Commun. COM-34(1986)576–586.
F.A. Tobagi and V.B. Hunt, Performance analysis of carrier sense multiple access with collision detection, Comput. Networks 4(1980)245–259.
B.S. Tsybakov and V.A. Mikhailov, Ergodicity of a slotted ALOHA system, Prob. Infor. Transmission 15(1980)301–312. (Translated from Russian original in Prob. Peredaci Infor. 15(1980)72–89.)
J.R. Wilson and A.A.B. Pritsker, A survey of research on simulation startup problems, Simulation 31(1978)55–58.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Park, J.S., Kang, K. Delay analysis for multidimensional queueing processes in CSMA/CD local area networks. Telecommunication Systems 1, 217–242 (1993). https://doi.org/10.1007/BF02136162
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02136162