The generalized expansion method for open finite queueing networks
type: Item
instance of: scholarly article
title: The generalized expansion method for open finite queueing networks
zbMATH Open document ID: 0691.60088
DOI: 10.1016/S0377-2217(87)80012-7
author: Laoucine Kerbache
author: James MacGregor Smith
published in: European Journal of Operational Research
publication date: 1987-01-01T00:00:00Z
review text: An open queueing network is analyzed approximately by superposing arrival streams, splitting departure streams and artificial nodes to allow for blocked customers. Renewal processes are assumed (not necessarily Poisson). Extensive numerical examples are given, which compare favorably with simulation results.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 65C99
zbMATH DE Number: 4131411
zbMATH Keywords: open queueing network
zbMATH Keywords: Renewal processes
zbMATH Keywords: simulation results
reviewed by: B. D. Craven
MaRDI profile type: Publication
cites work: On Poisson Approximations for Superposition Arrival Processes in Queues
cites work: Q3903835
cites work: Approximate analysis of exponential tandem queues with blocking
cites work: Approximate analysis of exponential queueing systems with blocking
cites work: Q4166220
cites work: A Characterization of M/G/1 Queues with Renewal Departure Processes
cites work: Q3266696
cites work: Q3806522
cites work: Distribution of the Interoverflow Time for the GI/G/1 Loss System
cites work: Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
cites work: Erlang’s Formulas in the Theory of Mass Service
cites work: Q5643415
cites work: Q4101255
cites work: Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions
cites work: Approximate Analysis of General Queuing Networks by Decomposition
cites work: Some Inequalities in Queuing
cites work: Q4199812
cites work: On Renewal Processes Related to Type I and Type II Counter Models
cites work: Erlang's formula and some results on the departure process for a loss system
cites work: Regenerative stochastic processes
cites work: Q3256591
cites work: Q3266687
cites work: On Erlang's Formula
cites work: An Approximation Method for Open Restricted Queueing Networks
cites work: Approximating a Point Process by a Renewal Process: The View Through a Queue, an Indirect Approach
full work available at URL: s0377-2217(87)80012-7
OpenAlex ID: W1975917392
Recommended article: Asymptotic behavior of the expansion method for open finite queueing networks
Recommended article: Another approach to asymptotic expansions for large closed queueing networks
Recommended article: Asymptotic expansion for large closed queuing networks
Recommended article: Expansion method for the throughput analysis of open finite manufacturing/queueing networks with \(N\)-policy
Recommended article: Q3782765
Recommended article: An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis
Recommended article: Asymptotic expansions for large closed and loss queueing networks
Recommended article: Asymptotically exact decomposition approximations for open queueing networks
description: scientific article; zbMATH DE number 4131411