The QNET method for two-moment analysis of open queueing networks

DOI10.1007/BF02411463zbMath0702.60082OpenAlexW1981174774MaRDI QIDQ915280

J. Michael Harrison, Vien Nguyen

Publication date: 1990

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02411463

zbMATH Keywords

numerical examplesapproximation schemesstationary distributionopen network of single-server stationsproduct form approximationsteady-state performance analysis

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (30)

Existence and uniqueness of semimartingale reflecting Brownian motions in an orthant ⋮ Numerical methods for controlled and uncontrolled multiplexing and queueing systems ⋮ Fluid limits and diffusion approximations for networks of multi-server queues in heavy traffic ⋮ Dependence among single stations in series and its applications in productivity improvement ⋮ Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks ⋮ Controlled and optimally controlled multiplexing systems: A numerical exploration ⋮ Convergence to equilibria for fluid models of FIFO queueing networks ⋮ Performance evaluation of scheduling control of queueing networks: Fluid model heuristics ⋮ A robust queueing network analyzer based on indices of dispersion ⋮ Queueing networks with path-dependent arrival processes ⋮ Design of fork-join networks of First-In-First-out and infinite-server queues applied to clinical chemistry laboratories ⋮ Heavy-traffic limits for stationary network flows ⋮ Stability and instability of a two-station queueing network ⋮ A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline ⋮ A LINEAR PROGRAMMING APPROACH TO THE STEADY-STATE ANALYSIS OF REFLECTED BROWNIAN MOTION ⋮ Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks ⋮ Decomposable stationary distribution of a multidimensional SRBM ⋮ Optimal control of assignment of jobs to processors under heavy traffic ⋮ Brownian models of multiclass queueing networks: Current status and open problems ⋮ Nonexistence of Brownian models for certain multiclass queueing networks ⋮ Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling ⋮ The advantage of indices of dispersion in queueing approximations ⋮ A network of priority queues in heavy traffic: One bottleneck station ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Diffusion Limits for Open Networks of Finite-Buffer Queues ⋮ Many-server queues with customer abandonment: numerical analysis of their diffusion models ⋮ Higher order approximations for the single server queue with splitting, merging and feedback ⋮ Higher order approximations for tandem queueing networks ⋮ Taking account of correlations between streams in queueing network approximations ⋮ Towards better multi-class parametric-decomposition approximations for open queueing networks

Cites Work

• Unnamed Item
• Reflected Brownian motion on an orthant
• Multidimensional reflected Brownian motions having exponential stationary distributions
• Open Queueing Networks in Heavy Traffic
• Brownian models of open queueing networks with homogeneous customer populations^∗
• Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
• A multiclass feedback queue in heavy traffic
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• The diffusion approximation for tandem queues in heavy traffic
• Approximate Analysis of General Queuing Networks by Decomposition
• Shorter Notes: A Uniqueness Theorem for Certain Two-Point Boundary Value Problems: A Correction

This page was built for publication: The QNET method for two-moment analysis of open queueing networks