Asymptotic behavior of the expansion method for open finite queueing networks

DOI10.1016/0305-0548(88)90008-1zbMath0662.60105OpenAlexW2018082481MaRDI QIDQ1113550

Laoucine Kerbache, James MacGregor Smith

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90008-1

zbMATH Keywords

decompositiontandem queuesapproximation techniquePoisson arrival processfinite capacity queueing networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (31)

A decomposition approximation for finite-buffered flow lines of exponential queues ⋮ An efficient two-phase approximation method for exponential tandem queueing systems with blocking ⋮ Performance optimization of open zero-buffer multi-server queueing networks ⋮ Queue decomposition \& finite closed queueing network models ⋮ Buffer allocation for a class of nonlinear stochastic knapsack problems ⋮ Asymptotic bounds of throughput in series-parallel queueing networks ⋮ \(M/G/c/c\) state dependent queuing model for a road traffic system of two sections in tandem ⋮ Buffer allocation for an integer nonlinear network design problem ⋮ Approximate analysis of \(M/G/c/c\) state-dependent queueing networks ⋮ Properties and performance modelling of finite buffer \(M/G/1/K\) networks ⋮ An estimation approach for the influential-imitator diffusion ⋮ MODELING TRAFFIC FLOWS WITH QUEUEING MODELS: A REVIEW ⋮ A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity ⋮ Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers ⋮ Multi-objective routing within large scale facilities using open finite queueing networks ⋮ Modeling and optimization of buffers and servers in finite queueing networks ⋮ Closed-form expected queueing times of a tandem system with finite intermediate buffer: A recursive approach ⋮ Buffer and server allocation in general multi-server queueing networks ⋮ Optimal buffer allocation in finite closed networks with multiple servers ⋮ Topological arrangements of \(M/G/c/K\), \(M/G/c/c\) queues in transportation and material handling systems ⋮ Service and capacity allocation in \(M/G/c/c\) state-dependent queueing networks ⋮ An \(M/G/C/C\) state-dependent network simulation model ⋮ Buffer allocation in flow-shop-type production systems with general arrival and service patterns ⋮ Resource allocation in state-dependent emergency evacuation networks ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Optimal server allocation in general, finite, multi-server queueing networks ⋮ Topological network design of general, finite, multi-server queueing networks ⋮ Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization ⋮ An analytic finite capacity queueing network model capturing the propagation of congestion and blocking ⋮ Open finite queueing networks with \(M/M/C/K\) parallel servers ⋮ Generalized \(M/G/C/C\) state dependent queueing models and pedestrian traffic flows

Cites Work

• Unnamed Item
• Approximate analysis of exponential queueing systems with blocking
• Approximate analysis of exponential tandem queues with blocking
• Approximate behavior of tandem queues
• The use of decomposition techniques for the analysis of open restricted queuing networks
• The behaviour of a single queue in a general queueing network
• Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room
• Congestion in Blocking Systems-A Simple Approximation Technique
• An Approximation Method for Open Restricted Queueing Networks
• Approximate Analysis of General Queuing Networks by Decomposition
• Approximations to Stochastic Service Systems, with an Application to a Retrial Model
• Accuracy of the Diffusion Approximation for Some Queuing Systems
• Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions
• Networks of Waiting Lines
• Sequential Processing Machines (S.P.M) Analyzed With a Queuing Theory Model
• Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
• A Quadratically Convergent Newton-Like Method Based Upon Gaussian Elimination

This page was built for publication: Asymptotic behavior of the expansion method for open finite queueing networks