Weak convergence theorems for priority queues: preemptive-resume discipline

From MaRDI portal
Publication:5618814

DOI10.2307/3211839zbMath0215.53801OpenAlexW4384769020MaRDI QIDQ5618814

Ward Whitt

Publication date: 1971

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

Full work available at URL: https://doi.org/10.2307/3211839




Related Items (36)

Fluid and heavy traffic diffusion limits for a generalized processor sharing modelHeavy traffic limits for some queueing networksReal-time queues in heavy traffic with earliest-deadline-first queue disciplineA two-queue polling model with priority on one queue and heavy-tailed on/off sources: a heavy-traffic limitThe capacity of QoE for wireless networks with unreliable transmissionsDiffusion limits for shortest remaining processing time queuesSimulation of the idle time in multiphase queuesLimits and approximants for the M/G/1 LIFO waiting-time distributionAn asymptotic optimality result for the multiclass queue with finite buffers in heavy trafficAsymptotically tight steady-state queue length bounds implied by drift conditionsState space collapse and stability of queueing networksGaussian queues in light and heavy trafficThe (functional) law of the iterated logarithm of the sojourn time for a multiclass queueDiffusion limits for shortest remaining processing time queues under nonstandard spatial scalingA Fluid-Diffusion-Hybrid Limiting Approximation for Priority Systems with Fast and Slow CustomersDiffusion approximation of a multitype re-entrant line under smaller-buffer-first-served policyMinimizing the Maximum Expected Waiting Time in a Periodic Single-Server Queue with a Service-Rate ControlHeavy-traffic limits for a single-server queue leading up to a critical pointMaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy trafficStrong approximations for priority queues; head-to-the-line-first disciplineServe the shortest queue and Walsh Brownian motionFunctional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Overloaded CaseState space collapse for asymptotically critical multi-class fluid networksHeavy traffic analysis for EDF queues with renegingPathwise optimality of the exponential scheduling rule for wireless channelsWeak convergence inapplied probabilityMulti-layered round robin routing for parallel serversTwo-mode control of Brownian motion with quadratic loss and switching costsLimits and Approximations for the Busy-Period Distribution in Single-Server QueuesA network of priority queues in heavy traffic: One bottleneck stationAsymptotic relations in queueing theoryLimit theorems for finite damsDynamic Scheduling of a Four-Station Queueing NetworkCoupled Processor: A Second-Order Continuous-State-Space ModelHeavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributionsA law of iterated logarithm for multiclass queues with preemptive priority service discipline




This page was built for publication: Weak convergence theorems for priority queues: preemptive-resume discipline