A Simple Proof of Instability of a Random-Access Communication Channel
From MaRDI portal
Recommendations
- 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
- The number of packets transmitted by collision detect random access schemes
- Some Theorems on Instability with Applications to Multiaccess Protocols
- Analysis of a communication network with the adaptive ALOHA protocol for a finite number of stations under overload
Cites work
- A sufficient condition of nonergodicity of a Markov chain (Corresp.)
- Conditions for the non-ergodicity of Markov chains with application to a communication system
- Criteria for the non-ergodicity of stochastic processes: application to the exponential back-off protocol
- On the instability of slotted ALOHA multiaccess algorithm
- Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels
Cited in
(3)
This page was built for publication: A Simple Proof of Instability of a Random-Access Communication Channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415901)