Mean-field limits for large-scale random-access networks
From MaRDI portal
Publication:5084488
Functional limit theorems; invariance principles (60F17) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Internet topics (68M11) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic network models in operations research (90B15)
Abstract: We establish mean-field limits for large-scale random-access networks with buffer dynamics and arbitrary interference graphs. While saturated-buffer scenarios have been widely investigated and yield useful throughput estimates for persistent sessions, they fail to capture the fluctuations in buffer contents over time, and provide no insight in the delay performance of flows with intermittent packet arrivals. Motivated by that issue, we explore in the present paper random-access networks with buffer dynamics, where flows with empty buffers refrain from competition for the medium. The occurrence of empty buffers thus results in a complex dynamic interaction between activity states and buffer contents, which severely complicates the performance analysis. Hence we focus on a many-sources regime where the total number of nodes grows large, which not only offers mathematical tractability but is also highly relevant with the densification of wireless networks as the Internet of Things emerges. We exploit time scale separation properties to prove that the properly scaled buffer occupancy process converges to the solution of a deterministic initial-value problem, and establish the existence and uniqueness of the associated fixed point. This approach simplifies the performance analysis of networks with huge numbers of nodes to a low-dimensional fixed-point calculation. For the case of a complete interference graph, we demonstrate asymptotic stability, provide a simple closed-form expression for the fixed point, and prove interchange of the mean-field and steady-state limits. This yields asymptotically exact approximations for key performance metrics, in particular the stationary buffer content and packet delay distributions. The methodological framework that we develop easily extends to various model refinements as will be illustrated by several examples.
Recommendations
- Queue-based random-access algorithms: fluid limits and stability issues
- Delay performance in random-access networks
- Large homogeneous communication networks with Markovian access control. I: Equilibria and local stability
- Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
- Interacting multi-class transmissions in large stochastic networks
Cites work
- A scaling analysis of a transient stochastic network
- Asymptotic approximations for stationary distributions of many-server queues with abandonment
- How well can graphs represent wireless interference?
- scientific article; zbMATH DE number 3950178 (Why is no real title available?)
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- Large loss networks
- Mean field Markov models of wireless local area networks
- On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
- On the Asymptotic Validity of the Decoupling Assumption for Analyzing 802.11 MAC Protocol
- On the stability of polling models with multiple servers
- Performance Analysis of Contention Based Medium Access Control Protocols
- Representations of Markov processes as multiparameter time changes
- Stability and convergence of moments for multiclass queueing networks via fluid limit models
- State space collapse with application to heavy traffic limits for multiclass queueing networks
- The Distributional Little's Law and Its Applications
- The internet of things: a survey
- Uniqueness for Differential Equations Implies continuous Dependence only in Finite Dimension
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
Cited in
(12)- Large homogeneous communication networks with Markovian access control. II: Global behavior and residence time
- A mean field limit for a lattice caricature of dynamic routing in circuit switched networks
- Functional strong law of large numbers for loads in a planar network model
- Mean-field analysis of a scaling MAC radio protocol
- Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
- Slow transitions and starvation in dense random-access networks
- Gaussian and diffusion limits for multi-channel stochastic networks
- Dense limit of the Dawid–Skene model for crowdsourcing and regions of sub-optimality of message passing algorithms
- Large Deviations for the Stationary Measure of Networks Under Proportional Fair Allocations
- Method of asymptotic semiinvariants for studying a mathematical model of a random access network
- Fluid limits for QB-CSMA with polynomial rates, homogenization and reflection
- Stochastic averaging and mean-field for a large system with fast varying environment with applications to free-floating car-sharing
This page was built for publication: Mean-field limits for large-scale random-access networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084488)
