A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events
From MaRDI portal
Publication:1331296
DOI10.1007/BF01158961zbMath0811.68090OpenAlexW2073647217MaRDI QIDQ1331296
Mart L. Molle, George C. Polyzos
Publication date: 21 August 1994
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01158961
Cites Work
- Unnamed Item
- Upper bound for the delay in a multiple-random-access system with a splitting algorithm
- Random multiple access of packets to a channel with errors
- Computing packet delay for some random multiple access stack algorithms
- Some new random multiple-access algorithms
- Delay analysis of interval-searching contention resolution algorithms
- Analysis of a stack algorithm for random multiple-access communication
- <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
- Born again group testing: Multiaccess communications
- Delay Analysis of 0.487 Contention Resolution Algorithms
- D/G/1 Queues with Vacations
- Delay analysis of the n-ary stack random-access algorithm
- Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics
- Bounds on the delay distribution of window random-access algorithms
- A queueing theoretic approach to the delay analysis for the FCFS 0.487 conflict resolution algorithm
This page was built for publication: A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events