Dynamic server allocation to parallel queues with randomly varying connectivity

DOI10.1109/18.212277MaRDI QIDQ4202066zbMATH OpenOpenAlexFDO

Authors Leandros Tassiulas, Anthony Ephremides

Publication date 12 October 1993

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.212277

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(34)

• Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• The capacity of QoE for wireless networks with unreliable transmissions
• Detecting Markov chain instability: a Monte Carlo approach
• Stability and probability. I: Convergence for queueing networks via Lyapunov optimization
• On controlling prioritized discrete event systems with real-time constraints
• Delay-optimal scheduling for two-hop relay networks with randomly varying connectivity: join the shortest queue-longest connected queue policy
• The role of information in system stability with partially observable servers
• Flow-level performance and capacity of wireless networks with user mobility
• Asymptotic optimality of maximum pressure policies in stochastic processing networks
• MAX-weight scheduling across multiple timescales
• Mathematical methods to study the polling systems
• Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
• Dynamic power control in a fading downlink channel subject to an energy constraint
• Dynamic scheduling with reconfiguration delays
• Optimizing data throughput in client/server systems by keeping queue sizes balanced
• Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
• Whittle index approach to size-aware scheduling for time-varying channels with multiple states
• On distributed scheduling with heterogeneously delayed network-state information
• Asymptotically tight steady-state queue length bounds implied by drift conditions
• Queueing systems with hard delay constraints: a framework for real-time communication over unreliable wireless channels
• Stability with file arrivals and departures in multichannel cellular wireless networks
• Queueing and scheduling in random environments
• Lingering issues in distributed scheduling
• Solving convex optimization with side constraints in a multi-class queue by adaptive c rule
• SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
• Technical note -- A stochastic assignment problem with unknown eligibility probabilities
• Stability and Instability of the MaxWeight Policy
• Dynamic resource allocation in the cloud with near-optimal efficiency
• On the power of (even a little) resource pooling
• On the Stability Region of Maximum Weighted Matching Server Allocation Policy
• Stability regions of systems with compatibilities and ubiquitous measures on graphs
• Control of multi-node mobile communications networks with time-varying channels via stability methods
• Dynamic priority allocation via restless bandit marginal productivity indices

This page was built for publication: Dynamic server allocation to parallel queues with randomly varying connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202066)