On queueing problems in random-access communications
From MaRDI portal
Recommendations
- An access algorithm for a communication channel
- Analytic properties of multiple-access trees
- A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events
- Some new random multiple-access algorithms
- Analysis of a stack algorithm for random multiple-access communication
Cited in
(17)- A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events
- A special random selective service queueing model for access to a star LAN
- Transition time asymptotics of queue-based activation protocols in random-access networks
- Light-traffic analysis of random access systems without collisions
- Queue-based random-access algorithms: fluid limits and stability issues
- An access algorithm for a communication channel
- Analytic properties of multiple-access trees
- scientific article; zbMATH DE number 3932930 (Why is no real title available?)
- Bounds for Queue Lengths in a Contention Packet Broadcast System
- Cutoff points for roll call protocols in multiple access systems
- On some queueing models of time division multiple access communication system
- ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS
- Distributed Online and Stochastic Queueing on a Multiple Access Channel
- Rejoinder on: ``Queueing models for the analysis of communication systems
- Distributed Online and Stochastic Queuing on a Multiple Access Channel
- Comments on: ``Queueing models for the analysis of communication systems
- Performance analysis of test scheduling schemes for a multi-access communications network
This page was built for publication: On queueing problems in random-access communications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677646)