Towards better multi-class parametric-decomposition approximations for open queueing networks

DOI10.1007/BF02024659zbMath0788.60116MaRDI QIDQ1315343

Ward Whitt

Publication date: 24 May 1994

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

zbMATH Keywords

parametric-decomposition approximationsmulti-class single-server queueheavy-traffic limit theoremsnon- Poisson renewal arrival processnon-Markov open queueing networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (14)

Is network traffic approximated by stable Lévy motion or fractional Brownian motion? ⋮ Predicting performance measures for Markovian type of manufacturing systems with product failures ⋮ Solving general multi-class closed queuing networks using parametric decomposition ⋮ Approximating class-departure variability in tandem queues with downtime events: regression-based variability function ⋮ A multi-tier linking approach to analyze performance of autonomous vehicle-based storage and retrieval systems ⋮ Performance analysis of CONWIP systems with batch size constraints ⋮ Performance analysis of batching decisions in waveless order release environments for e‐commerce stock‐to‐picker order fulfillment ⋮ The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes ⋮ A hybrid method for performance analysis of \(G/G/m\) queueing networks ⋮ A queueing model for a two-stage stochastic manufacturing system with overlapping operations ⋮ The heavy-traffic bottleneck phenomenon under splitting and superposition ⋮ Supplier managed inventory in the OEM supply chain: The impact of relationship types on total costs and cost distribution ⋮ Class dependent departure process from multiclass phase queues: Exact and approximate analyses ⋮ Taking account of correlations between streams in queueing network approximations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The QNET method for two-moment analysis of open queueing networks
• The heavy-traffic bottleneck phenomenon in open queueing networks
• Asymptotically exact decomposition approximations for open queueing networks
• Approximation of departure process from a G/M/1/0 queueing system
• The interdeparture-time distribution for each class in the \(\Sigma _ iM_ i/G_ i/1\) queue
• Brownian models of multiclass queueing networks: Current status and open problems
• Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues
• Characterising interdeparture times for bursty input streams in the queue with pooled renewal arrivals
• Approximations for departure processes and queues in series
• Approximation for the departure process of a queue in a network
• Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
• Some Useful Functions for Functional Limit Theorems
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• Approximate Analysis of General Queuing Networks by Decomposition
• Large Fluctuations in a Deterministic Multiclass Network of Queues
• Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks
• Accuracy of the Diffusion Approximation for Some Queuing Systems
• Delays for Customers from Different Arrival Streams to a Queue
• A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues
• Multiple channel queues in heavy traffic. II: sequences, networks, and batches
• Multiple channel queues in heavy traffic. I

This page was built for publication: Towards better multi-class parametric-decomposition approximations for open queueing networks