A Matrix Representation of CSMA/CD Networks

DOI10.1109/TCOM.1985.1096191zbMATH Open0554.90037OpenAlexW2146054832MaRDI QIDQ3217892FDOQ3217892

Authors: Edward J. Coyle, Bede Liu 

Publication date: 1985

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1985.1096191

Recommendations

• Stability of p-Persistent CSMA/CD
• Asymptotic performance characteristics of CSMA and CSMA\(\gets\)CD\(\to\)CSMA/CD networks
• On the applicability of the number of collisions in \(p\)-persistent CSMA/CD protocols
• Throughput Analysis for Persistent CSMA Systems
• scientific article; zbMATH DE number 4010376

zbMATH Keywords

necessary and sufficient conditions for stabilityasynchronous nonpersistent CSMA/CD (carrier sense multiple access/collision detection) networkscontinuous time Markov chain model

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cited In (8)

• On the applicability of the number of collisions in \(p\)-persistent CSMA/CD protocols
• Title not available (Why is that?)
• Title not available (Why is that?)
• Performance analysis of CSMA/CD-DRC system
• Stability and throughout in virtual time CSMA
• Title not available (Why is that?)
• A mean value analysis of the Ethernet troughput
• Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC

This page was built for publication: A Matrix Representation of CSMA/CD Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217892)