Delay performance in random-access networks
From MaRDI portal
Publication:475111
DOI10.1007/S11134-014-9408-8zbMATH Open1309.68022arXiv1305.3774OpenAlexW1986809491MaRDI QIDQ475111FDOQ475111
Authors: Sem Borst, Niek Bouman, Johan S. H. van Leeuwaarden 
Publication date: 25 November 2014
Published in: Queueing Systems (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1305.3774
Recommendations
Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18)
Cites Work
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Title not available (Why is that?)
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Randomized scheduling algorithm for queueing networks
- Queues with random back-offs
- Workloads and waiting times in single-server systems with multiple customer classes
- Distributed Random Access Algorithm: Scheduling and Congestion Control
- Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling
- Stability and delay of distributed scheduling algorithms for networks of conflicting queues
- Hardness of Low Delay Network Scheduling
- Pseudo-conservation laws in cyclic-service systems
- Queue-based random-access algorithms: fluid limits and stability issues
- Medium Access Using Queues
Cited In (19)
- Mean-field limits for large-scale random-access networks
- Measuring Temporal Lags in Delay-Tolerant Networks
- Slow transitions and starvation in dense random-access networks
- Delay performance in stochastic processing networks with priority service.
- Crossover times in bipartite networks with activity constraints and time-varying switching rates
- On the delay in a multiple-access system with large propagation delay
- Delay analysis and optimality of the renewal access protocol
- 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
- Lingering issues in distributed scheduling
- Transition time asymptotics of queue-based activation protocols in random-access networks
- Queues with random back-offs
- Packet delay under the golden ratio weighted TDM policy in a multiple-access channel
- Effects of short-cut in a delayed ring network
- Adding edge dynamics to bipartite random-access networks
- Transmissions in a network with capacities and delays
- Packet delay in the case of a multiple-access stack algorithm
- Exploration of carrier-based time-varying networks: the power of waiting
- The delay analysis in a noisy general cut-through switching network
- Temporal starvation in multi-channel CSMA networks: an analytical framework
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)
