Dynamic Distributed Scheduling in Random Access Networks

DOI10.1239/JAP/1214950349zbMath1151.90006OpenAlexW2032383861MaRDI QIDQ3516405

Alexander L. Stolyar

Publication date: 5 August 2008

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1214950349

zbMATH Keywords

stabilityqueueing networkmedium access controlrandom multiple accessslotted aloha

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Network protocols (68M12)

Related Items (6)

A Random Multiple-Access Protocol with Spatial Interactions ⋮ Large deviations of queues sharing a randomly time-varying server ⋮ Analysis of the shortest relay queue policy in a cooperative random access network with collisions ⋮ Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks ⋮ 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 ⋮ Stability and moment bounds under utility-maximising service allocations: Finite and infinite networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
• Fluid approximations and stability of multiclass queueing networks: Work-conserving disciplines
• Ergodicity of stochastic processes describing the operation of open queueing networks
• The collision channel without feedback
• Pathwise optimality of the exponential scheduling rule for wireless channels
• SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
• Stability and convergence of moments for multiclass queueing networks via fluid limit models
• Stability of data networks under an optimization-based bandwidth allocation
• Throughput Region of Random-Access Networks of General Topology
• Achieving Proportional Fairness Using Local Information in Aloha Networks
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Maximum Pressure Policies in Stochastic Processing Networks

This page was built for publication: Dynamic Distributed Scheduling in Random Access Networks