Strong approximations for multiclass feedforward queueing networks.

From MaRDI portal
Publication:1872497

DOI10.1214/aoap/1019487511zbMath1083.60511OpenAlexW2068769043MaRDI QIDQ1872497

Xinyang Shen, Hong Chen

Publication date: 6 May 2003

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

Full work available at URL: https://projecteuclid.org/euclid.aoap/1019487511




Related Items

A law of the iterated logarithm for the sojourn time process in queues in seriesHeavy-traffic limits for many-server queues with service interruptionsFunctional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedbackOn the asymptotic optimality of the \(c\mu\)-rule in queueing networksStrong approximations for a Kumar-Seidman network under a priority service disciplineAsymptotic variability analysis for a two-stage tandem queue. I: The functional law of the iterated logarithmAsymptotic variability analysis for a two-stage tandem queue. II: The law of the iterated logarithmThe (functional) law of the iterated logarithm of the sojourn time for a multiclass queueStrong approximation method and the (functional) law of iterated logarithm for \(GI/G/1\) queueAbout the sojourn time process in multiphase queueing systemsFunctional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Overloaded CaseFunctional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Underloaded and Critically Loaded CasesA functional law of the iterated logarithm for multi-class queues with batch arrivalsSample path large deviations for multiclass feedforward queueing networks in critical loadingFractional Brownian heavy traffic approximations of multiclass feedforward queueing networksPathwise differentiability of reflected diffusions in convex polyhedral domainsA law of iterated logarithm for multiclass queues with preemptive priority service discipline



Cites Work