Strong approximations for multiclass feedforward queueing networks.

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

zbMATH Keywords

heavy trafficdiffusion approximationsfluid approximationsreflected Brownian motionMulticlass queueing network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Sample path properties (60G17) Functional limit theorems; invariance principles (60F17) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)

Related Items (17)

A law of the iterated logarithm for the sojourn time process in queues in series ⋮ Heavy-traffic limits for many-server queues with service interruptions ⋮ Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback ⋮ On the asymptotic optimality of the \(c\mu\)-rule in queueing networks ⋮ Strong approximations for a Kumar-Seidman network under a priority service discipline ⋮ Asymptotic variability analysis for a two-stage tandem queue. I: The functional law of the iterated logarithm ⋮ Asymptotic variability analysis for a two-stage tandem queue. II: The law of the iterated logarithm ⋮ The (functional) law of the iterated logarithm of the sojourn time for a multiclass queue ⋮ Strong approximation method and the (functional) law of iterated logarithm for \(GI/G/1\) queue ⋮ About the sojourn time process in multiphase queueing systems ⋮ Functional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Overloaded Case ⋮ Functional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Underloaded and Critically Loaded Cases ⋮ A functional law of the iterated logarithm for multi-class queues with batch arrivals ⋮ Sample path large deviations for multiclass feedforward queueing networks in critical loading ⋮ Fractional Brownian heavy traffic approximations of multiclass feedforward queueing networks ⋮ Pathwise differentiability of reflected diffusions in convex polyhedral domains ⋮ A law of iterated logarithm for multiclass queues with preemptive priority service discipline

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reflected Brownian motion in an orthant: Numerical methods for steady- state analysis
• Brownian models of feedforward queueing networks: Quasireversibility and product form solutions
• Strong approximation for Markovian service networks
• State-dependent stochastic networks. I: Approximation and applications with continuous diffusion limits
• Brownian models of multiclass queueing networks: Current status and open problems
• A sufficient condition for the positive recurrence of a semimartingale reflecting Brownian motion in an orthant
• Strong approximations for multiple channel queues in heavy traffic
• A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
• Some Useful Functions for Functional Limit Theorems
• Strong Approximations of Open Queueing Networks
• Heavy Traffic Limit Theorems for Queues: A Survey
• State of the Art—Networks of Queues: A Survey of Weak Convergence Results
• Strong Approximations of Irreducible Closed Queueing Networks
• Strong Approximations for Time-Dependent Queues

This page was built for publication: Strong approximations for multiclass feedforward queueing networks.