Asymptotic behavior of the 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: In previous papers, we have reported on the use of the expansion method for estimating sojourn times in finite network topologies. In this paper, we focus on comparing the expansion method with P. C. Bell's consistency conditions where subject to unbalanced service rates at tandem queues, other decomposition approaches yield impossible throughput results. We compare numerical results of the expansion method with the other approaches in light of these conditions.

Keywords: Queue; Network; Queueing system (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Published in Computers and Operations Research, 1988, 15 (2), pp.157-169. ⟨10.1016/0305-0548(88)90008-1⟩

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-00484446

DOI: 10.1016/0305-0548(88)90008-1

Access Statistics for this paper

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