Asymptotically tight steady-state queue length bounds implied by drift conditions
From MaRDI portal
Publication:373455
DOI10.1007/S11134-012-9305-YzbMath1273.90054arXiv1104.0327OpenAlexW1995643834MaRDI QIDQ373455
Publication date: 22 October 2013
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.0327
Communication networks in operations research (90B18) Queues and service in operations research (90B22) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (19)
An algorithm for improved delay-scaling in input-queued switches ⋮ Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ The capacity of QoE for wireless networks with unreliable transmissions ⋮ Optimal heavy-traffic queue length scaling in an incompletely saturated switch ⋮ A load balancing system in the many-server heavy-traffic asymptotics ⋮ <scp>Steady‐state</scp> analysis of load balancing with Coxian‐2 distributed service times ⋮ Stochastic coordination in heterogeneous load balancing systems ⋮ Fluctuation Bounds for the Max-Weight Policy with Applications to State Space Collapse ⋮ Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks ⋮ Process Flexibility for Multiperiod Production Systems ⋮ Transform Methods for Heavy-Traffic Analysis ⋮ Heavy traffic queue length scaling in switches with reconfiguration delay ⋮ Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime ⋮ Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems ⋮ Diffusion Limit of Fair Resource Control—Stationarity and Interchange of Limits ⋮ Stationary distribution convergence of the offered waiting processes in heavy traffic under general patience time scaling ⋮ Logarithmic heavy traffic error bounds in generalized switch and load balancing systems ⋮ Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies ⋮ Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling
Cites Work
- Unnamed Item
- Unnamed Item
- Systems with large flexible server pools: instability of ``natural load balancing
- Markov chains and stochastic stability
- Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
- Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
- State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
- Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints
- Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
- State space collapse with application to heavy traffic limits for multiclass queueing networks
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- Dynamic scheduling for minimum delay in tandem and parallel constrained queueing models
- Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions
- Heavy traffic resource pooling in parallel-server systems
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
- Equivalent Models for Queueing Analysis of Deterministic Service Time Tree Networks
- Bounding Stationary Expectations of Markov Processes
- Stability and Asymptotic Optimality of Generalized MaxWeight Policies
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- Resource pooling in queueing networks with dynamic routing
- A Basic Dynamic Routing Problem and Diffusion
- Dynamic server allocation to parallel queues with randomly varying connectivity
- Optimal dynamic scheduling of a general class of parallel-processing queueing systems
- Performance bounds for queueing networks and scheduling policies
- Optimal Control of a Multiclass, Flexible Queueing System
- Pathwise optimality of the exponential scheduling rule for wireless channels
- Stability of queueing networks and scheduling policies
- Applied Probability and Queues
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- On the Queue-Overflow Probability of Wireless Systems: A New Approach Combining Large Deviations With Lyapunov Functions
- Control Techniques for Complex Networks
- Weak convergence theorems for priority queues: preemptive-resume discipline
- Some inequalities for the queue GI/G/1
This page was built for publication: Asymptotically tight steady-state queue length bounds implied by drift conditions
