An Approximate Analytical Method for General Queueing Networks

DOI10.1109/TSE.1979.234214zbMath0422.90037WikidataQ56784522 ScholiaQ56784522MaRDI QIDQ3856405

Raymond Marie

Publication date: 1979

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

zbMATH Keywords

system of nonlinear equationsperformance evaluationapproximate solutionequilibrium distributionclosed queueing networkservice time distributionapproximate stationary state probabilitiesChang- Lavenberg theorem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (19)

The exponentialization approach to flexible manufacturing system models with general processing times ⋮ Performance bounds for modeling NUMA architectures ⋮ Evaluation of the performance parameters of a closed queuing network using artificial neural networks ⋮ Multilevel aggregation of central server models: a minimum relative entropy approach ⋮ Solving general multi-class closed queuing networks using parametric decomposition ⋮ Approximation analysis of multi-class closed queueing maintenance networks with a parts inventory system and two-phase Coxian time distributions ⋮ Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks. ⋮ Heuristic analysis of closed queueing networks ⋮ Evaluating the effect of tool management on flexible manufacturing system performance ⋮ Approximate analysis of load-dependent generally distributed queuing networks with low service time variability ⋮ A multi-class closed queueing maintenance network model with a parts inventory system ⋮ A regression metamodel of a maintenance float problem with Erlang-2 failure distribution ⋮ Analysis of a synchronization station for the performance evaluation of a kanban system with a general arrival process of demands ⋮ Analysis of an open tandem queueing network with population constraint and constant service times ⋮ Queueing models for a flexible machining station. II: The method of Coxian phases ⋮ Theory of queuing networks and its applications to the analysis of information-computing systems ⋮ Approximate solution of a dynamic job shop model with several job classes ⋮ Approximate techniques for general closed queueing networks with subnetworks having population constraints ⋮ Open finite queueing networks with \(M/M/C/K\) parallel servers

This page was built for publication: An Approximate Analytical Method for General Queueing Networks