The generalized expansion method for open finite queueing networks
Laoucine Kerbache, J. M. Smith
Abstract
Laoucine Kerbache, J. M. Smith
Abstract
Blocking makes the exact analytical analysis of open queueing networks with finite capacities intractable except for very small networks, therefore, approximation approaches are needed to analyze these types of networks. For exponential open finite queueing networks, some methods have been proposed but little has been done so far on nonexponential open finite queueing networks. This paper introduces a new approximation technique for the analysis of general open finite queueing networks. Extensive numerical examples are performed for different network topologies and the results are compared with simulation.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Blocking makes the exact analytical analysis of open queueing networks with finite capacities intractable except for very small networks, therefore, approximation approaches are needed to analyze these types of networks. For exponential open finite queueing networks, some methods have been proposed but little has been done so far on nonexponential open finite queueing networks. This paper introduces a new approximation technique for the analysis of general open finite queueing networks. Extensive numerical examples are performed for different network topologies and the results are compared with simulation.
Key concepts: Queueing theory, Layered queueing network, G-network, Mean value analysis, Computer science, Network topology, Mathematical optimization, Traffic equations