The delay characteristics of CSMA/CD networks

A continuous-time Markov chain model of the CSMA/CD (carrier-sense multiple-access with collision detection) protocol is used to find its delay characteristics. For both random-service-order (RSO) and first-come-first-serve (FCFS) CSMA/CD networks, matrix-geometric methods are used to derive and/or compute the throughput-delay and caudal-characteristics curves, the distribution and variance of the delay, and the rate of decay of the tail of the delay distribution. These results can be used to determine the suitability of RSO and FCFS CSMA/CD networks in applications in which they must carry delay-sensitive data. This is illustrated by an example which shows the significant improvement obtained in the delay characteristics of a particular network when FCFS is used instead of RSO. >

[1]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[2]  C. Loan,et al.  Nineteen Dubious Ways to Compute the Exponential of a Matrix , 1978 .

[3]  Erhan Çinlar,et al.  Introduction to stochastic processes , 1974 .

[4]  M. Neuts.  The caudal characteristic curve of queues , 1984, Advances in Applied Probability.

[5]  Marcel F. Neuts.  Stationary Waiting Time Distributions in the GI/PH/1 Queue. , 1981 .

[6]  Fouad A. Tobagi,et al.  Distributions of packet delay and interdeparture time in slotted ALOHA and carrier sense multiple access , 1982, JACM.

[7]  Yukio Takahashi.  Asymptotic exponentiality of the tail of the waiting-time distribution in a Ph/Ph/C queue , 1981, Advances in Applied Probability.

[8]  Robert Metcalfe,et al.  Ethernet: distributed packet switching for local computer networks , 1976, CACM.

[9]  Chin-Tau A. Lea,et al.  Stability and Throughput in Virtual Time CSMA , 1986, Comput. Networks.

[10]  J. Meditch,et al.  Stability and Optimization of the CSMA and CSMA/CD Channels , 1983, IEEE Trans. Commun..

[11]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics , 1975, IEEE Transactions on Communications.

[12]  V. Ramaswami,et al.  Stationary waiting time distribution in queues with phase type service and in quasi-birth-and-death process , 1985, STOC 1985.

[13]  Bruce Hajek,et al.  Decentralized dynamic control of a multiaccess broadcast channel , 1982 .

[14]  Simon S. Lam,et al.  A Carrier Sense Multiple Access Protocol for Local Networks , 1979, Comput. Networks.

[15]  M. Neuts.  Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector , 1978, Advances in Applied Probability.

[16]  J. F. C. Kingman,et al.  On queues in which customers are served in random order , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[17]  Fouad A. Tobagi,et al.  Performance Analysis of Carrier Sense Multiple Access with Collision Detection , 1980, Comput. Networks.

[18]  E. Coyle,et al.  Finite Population CSMA/CD Networks , 1983, IEEE Trans. Commun..

[19]  Edward J. Coyle,et al.  A Matrix Representation of CSMA/CD Networks , 1985, IEEE Trans. Commun..

[20]  Izhak Rubin.  Synchronous and Channel-Sense Asynchronous Dynamic Group-Random-Access Schemes for Multiple-Access Communications , 1983, IEEE Trans. Commun..