The generalized expansion method for open finite queueing networks

Laoucine Kerbache () and J.Macgregor Smith
Additional contact information
Laoucine Kerbache: UMass Amherst - University of Massachusetts [Amherst] - UMASS - University of Massachusetts System

Post-Print from HAL

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.

Keywords: Queuing; networks; approximations (search for similar items in EconPapers)
Date: 1987-12
References: Add references at CitEc
Citations: View citations in EconPapers (17)

Published in European Journal of Operational Research, 1987, 32 (3), pp.448-461. ⟨10.1016/S0377-2217(87)80012-7⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-00484457

DOI: 10.1016/S0377-2217(87)80012-7

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().