Randomized longest-queue-first scheduling for large-scale buffered systems

DOI10.1239/aap/1449859798zbMath1335.90015arXiv1306.5347OpenAlexW2962984747MaRDI QIDQ2786425

No author found.

Publication date: 12 February 2016

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

Full work available at URL: https://arxiv.org/abs/1306.5347

zbMATH Keywords

queueingmean fielddiffusion limitfluid limit

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Related Items (3)

Mean field approximations to a queueing system with threshold-based workload control scheme ⋮ Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics ⋮ Power-of-d-Choices with Memory: Fluid Limit and Optimality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decay of tails at equilibrium for FIFO join the shortest queue networks
• Asymptotic independence of queues under randomized load balancing
• Strong approximation theorems for density dependent Markov chains
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
• Occupancy Distributions of Homogeneous Queueing Systems Under Opportunistic Scheduling
• Performance evaluation of a production/inventory system with periodic review and endogenous lead times

This page was built for publication: Randomized longest-queue-first scheduling for large-scale buffered systems