Delay performance in random-access networks
From MaRDI portal
Abstract: We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed queue-based random-access schemes provide the striking capability to match the optimal throughput performance of centralized scheduling mechanisms in a wide range of scenarios. The specific type of activation rules for which throughput optimality has been established, may however yield excessive queues and delays. Motivated by that issue, we examine whether the poor delay performance is inherent to the basic operation of these schemes, or caused by the specific kind of activation rules. We derive delay lower bounds for queue-based activation rules, which offer fundamental insight in the cause of the excessive delays. For fixed activation rates we obtain lower bounds indicating that delays and mixing times can grow dramatically with the load in certain topologies as well.
Recommendations
Cites work
- scientific article; zbMATH DE number 1093829 (Why is no real title available?)
- Distributed Random Access Algorithm: Scheduling and Congestion Control
- Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling
- Hardness of Low Delay Network Scheduling
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Medium Access Using Queues
- Pseudo-conservation laws in cyclic-service systems
- Queue-based random-access algorithms: fluid limits and stability issues
- Queues with random back-offs
- Randomized scheduling algorithm for queueing networks
- Stability and delay of distributed scheduling algorithms for networks of conflicting queues
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Workloads and waiting times in single-server systems with multiple customer classes
Cited in
(19)- Queues with random back-offs
- Mean-field limits for large-scale random-access networks
- Measuring Temporal Lags in Delay-Tolerant Networks
- Delay performance in stochastic processing networks with priority service.
- Effects of short-cut in a delayed ring network
- The delay analysis in a noisy general cut-through switching network
- Slow transitions and starvation in dense random-access networks
- Exploration of carrier-based time-varying networks: the power of waiting
- Adding edge dynamics to bipartite random-access networks
- On the delay in a multiple-access system with large propagation delay
- Crossover times in bipartite networks with activity constraints and time-varying switching rates
- Temporal starvation in multi-channel CSMA networks: an analytical framework
- On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency
- Transmissions in a network with capacities and delays
- Packet delay in the case of a multiple-access stack algorithm
- Delay analysis and optimality of the renewal access protocol
- Transition time asymptotics of queue-based activation protocols in random-access networks
- Lingering issues in distributed scheduling
- Packet delay under the golden ratio weighted TDM policy in a multiple-access channel
This page was built for publication: Delay performance in random-access networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475111)
