Higher order approximations for tandem queueing networks

DOI10.1007/BF01149174zbMath0860.60071OpenAlexW2018679441MaRDI QIDQ2564186

Yanyan Li

Publication date: 23 January 1997

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

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

zbMATH Keywords

approximationsMacLaurin seriestandem queueing networks\(GI/G/1\) queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (5)

A functional approximation for the M/G/1/N queue ⋮ A tandem queueing model for an appointment-based service system ⋮ Approximations for the departure process of the G/G/1 queue with Markov-modulated arrivals ⋮ Higher order approximations for the single server queue with splitting, merging and feedback ⋮ Higher order approximations for tandem queueing networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The MacLaurin expansion for a \(G/G/1\) queue with Markov-modulated arrivals and services
• An investigation of phase-distribution moment-matching algorithms for use in queueing models
• A graphical investigation of error bounds for moment-based queueing approximations
• The QNET method for two-moment analysis of open queueing networks
• The exponentialization approach to flexible manufacturing system models with general processing times
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• On queueing network models of flexible manufacturing systems
• Analyticity of single-server queues in light traffic
• Higher order approximations for tandem queueing networks
• Light Traffic Approximations in Queues
• Matching moments to phase distributions: density function shapes
• Approximations for departure processes and queues in series
• On Approximations for Queues, III: Mixtures of Exponential Distributions
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• The MacLaurin series for the GI/G/1 queue
• Meda: mixed erlang distributions as phase-type representations of empirical distribution functions.
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Approximate Analysis of General Queuing Networks by Decomposition
• Selecting Parameters of Phase Distributions: Combining Nonlinear Programming, Heuristics, and Erlang Distributions
• Approximating Nonrenewal Processes by Markov Chains: Use of Super-Erlang (SE) Chains
• Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks
• Analysis of the ΣPhi/Ph/1 Queue
• The Departure Process of the GI/G/1 Queue and Its MacLaurin Series
• Matching moments to phase distributions: Mixtures of erlang distributions of common order
• Pade approximation for stochastic discrete-event systems
• The Impact of Autocorrelation on Queuing Systems
• Closed Queuing Systems with Exponential Servers
• Some Inequalities in Queuing
• Approximations for the departure process of the G/G/1 queue with Markov-modulated arrivals

This page was built for publication: Higher order approximations for tandem queueing networks