A Simple Proof of Instability of a Random-Access Communication Channel

DOI10.1017/S0269964800000929zbMath1134.94304OpenAlexW2134412143MaRDI QIDQ3415901

Sheldon M. Ross

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964800000929

Mathematics Subject Classification ID

Probabilistic measure theory (60A10) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Communication theory (94A05)

Cites Work

• Criteria for the non-ergodicity of stochastic processes: application to the exponential back-off protocol
• Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels
• On the instability of slotted ALOHA multiaccess algorithm
• Conditions for the non-ergodicity of Markov chains with application to a communication system
• A sufficient condition of nonergodicity of a Markov chain (Corresp.)

This page was built for publication: A Simple Proof of Instability of a Random-Access Communication Channel