Stability and delay of distributed scheduling algorithms for networks of conflicting queues

DOI10.1007/s11134-012-9286-xzbMath1275.68038OpenAlexW1994318055MaRDI QIDQ383296

Libin Jiang, Jean Walrand

Publication date: 25 November 2013

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-012-9286-x

zbMATH Keywords

optimizationschedulingMarkov chainwireless networksLyapunov analysiscarrier sense multiple access

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Related Items

Delay performance in random-access networks ⋮ Lingering issues in distributed scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic Network Optimization with Application to Communication and Queueing Systems
• Scheduling and Congestion Control for Wireless and Processing Networks
• Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling
• Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
• Self-Organization Properties of CSMA/CA Systems and Their Consequences on Fairness
• Hardness of Low Delay Network Scheduling
• Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints
• Distributed Random Access Algorithm: Scheduling and Congestion Control
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Markov Approximation for Combinatorial Network Optimization
• Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits