A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types

From MaRDI portal
Revision as of 15:40, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3349739

DOI10.1287/MOOR.16.1.90zbMath0727.60114OpenAlexW2103696735MaRDI QIDQ3349739

William P. Peterson

Publication date: 1991

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.16.1.90






Related Items (33)

On positive recurrence of constrained diffusion processesHeavy traffic limits for some queueing networksDynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policyReal-time queues in heavy traffic with earliest-deadline-first queue disciplineStrong approximations for multiclass feedforward queueing networks.Fluid limits and diffusion approximations for networks of multi-server queues in heavy trafficEarliest-deadline-first service in heavy-traffic acyclic networks.A Fair Policy for the G/GI/N Queue with Multiple Server PoolsDiffusion approximations for re-entrant lines with a first-buffer-first-served priority disciplineOn the asymptotic optimality of the \(c\mu\)-rule in queueing networksThe (functional) law of the iterated logarithm of the sojourn time for a multiclass queueA Monte Carlo Method for Estimating Sensitivities of Reflected Diffusions in Convex Polyhedral DomainsReflected Brownian motion with drift in a wedgeFunctional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Overloaded CaseState space collapse for asymptotically critical multi-class fluid networksBrownian motion with asymptotically normal reflection in unbounded domains: from transience to stabilityThe heavy traffic limit of an unbalanced generalized processor sharing modelA time-reversed representation for the tail probabilities of stationary reflected Brownian motion.Sample path large deviations for multiclass feedforward queueing networks in critical loadingBrownian models of multiclass queueing networks: Current status and open problemsNonexistence of Brownian models for certain multiclass queueing networksDynamic routing in open queueing networks: Brownian models, cut constraints and resource poolingQueueing networks with dependent nodes and concurrent movementsA network of priority queues in heavy traffic: One bottleneck stationDiffusion approximation for a heavily loaded multi-user wireless communication system with cooperationA sufficient condition for the positive recurrence of a semimartingale reflecting Brownian motion in an orthantSensitivity Analysis for the Stationary Distribution of Reflected Brownian Motion in a Convex Polyhedral ConeTreelike queueing networks: Asymptotic stationarity and heavy trafficFractional Brownian heavy traffic approximations of multiclass feedforward queueing networksPathwise differentiability of reflected diffusions in convex polyhedral domainsManaging variances in manufacturing system designA law of iterated logarithm for multiclass queues with preemptive priority service disciplineDiffusion approximations for Kumar-Seidman network under a priority service discipline







This page was built for publication: A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types