Stability of p-Persistent CSMA/CD

DOI10.1287/IJOC.7.2.149MaRDI QIDQ4896443zbMATH OpenOpenAlexFDO

Authors June S. Park, Walter A. Rosenkrantz, Robert Bartoszyński

Publication date 10 April 1997

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.7.2.149

zbMATH Keywords

ergodicityfinite population of buffered usersmultidimensional Lyapunov functionsqueuing processrecurrencesemi-Markovian modelstability conditionstransience

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• A Matrix Representation of CSMA/CD Networks
• 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
• Queueing Analysis For Buffered Persistent Csma Local Networks
• Throughput Analysis for Persistent CSMA Systems

Cited in

(7)

• 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
• A Matrix Representation of CSMA/CD Networks
• Throughput Analysis for Persistent CSMA Systems
• Stability and throughout in virtual time CSMA
• scientific article; zbMATH DE number 7029022 (Why is no real title available?)
• Queueing Analysis For Buffered Persistent Csma Local Networks

This page was built for publication: Stability of p-Persistent CSMA/CD

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