A SIMPLE AND QUICK APPROXIMATION ALGORITHM FOR TANDEM, SPLIT-AND-MERGE QUEUING-NETWORKS WITH BLOCKING

Authors
YANNOPOULOS E ALFA AS
Citation
E. Yannopoulos et As. Alfa, A SIMPLE AND QUICK APPROXIMATION ALGORITHM FOR TANDEM, SPLIT-AND-MERGE QUEUING-NETWORKS WITH BLOCKING, INFOR. Information systems and operational research, 32(4), 1994, pp. 288-308
Citations number
NO
Categorie Soggetti
Operatione Research & Management Science
Journal title
INFOR. Information systems and operational research → ACNP
ISSN journal
03155986
Volume
32
Issue
4
Year of publication
1994
Pages
288 - 308
Database
ISI
SICI code
0315-5986(1994)32:4<288:ASAQAA>2.0.ZU;2-#
Abstract
A simple and quick approximation algorithm for the analysis of tandem, split and merge queueing networks with general arrival and service pr ocesses with blocking is presented. The algorithm gives good estimates of the average sojourn time through the network for moderate and heav y traffic. This approximation is a very valuable tool for cases where computational time is very important, especially in optimization proce dures. It is also very useful for the analysis of general split and me rge systems consisting of more than three nodes.