by Rabta, Boualem
Abstract:
Open queueing networks are useful for modeling and performance evaluation of complex systems such as computer systems, communication networks, production lines and manufacturing systems. Exact analytical results are available only in few situations with restricted assumptions. In the general case, feasible solutions can be obtained only through approximations. This paper reviews performance evaluation methods for open queueing systems with focus on decomposition methods.
Reference:
A Review of Decomposition Methods for Open Queueing Networks (Rabta, Boualem), Chapter in Rapid Modelling for Increasing Competitiveness (Reiner, Gerald, ed.), Springer London, 2009.
Bibtex Entry:
@INCOLLECTION{rmc2009-2,
author = {Rabta, Boualem},
title = {A Review of Decomposition Methods for Open Queueing Networks},
booktitle = {Rapid Modelling for Increasing Competitiveness},
publisher = {Springer London},
year = {2009},
editor = {Reiner, Gerald},
pages = {25-42},
doi = {10.1007/978-1-84882-748-6_3},
isbn = {978-1-84882-747-9},
language = {English},
gsid = {5067087852647140372},
url = {http://dx.doi.org/10.1007/978-1-84882-748-6_3},
abstract = {Open queueing networks are useful for modeling and performance evaluation of complex systems such as computer systems, communication networks, production lines and manufacturing systems. Exact analytical results are available only in few situations with restricted assumptions. In the general case, feasible solutions can be obtained only through approximations. This paper reviews performance evaluation methods for open queueing systems with focus on decomposition methods.}
}