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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 1988-05, Vol.36 (5), p.553-563
Main Authors: Beuerman, S.L., Coyle, E.J.
Format: Article
Language:English
Subjects:
Applied sciences
Business and industry local networks
Communication system control
Computer networks
Delay
Distributed computing
Exact sciences and technology
Intelligent networks
Local area networks
Multiaccess communication
Networks and services in france and abroad
Probability distribution
Protocols
Real time systems
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
ISSN:0090-6778
1558-0857
DOI:10.1109/26.1471