Approximate Transient Analysis of Queuing Networks by Quasi Product Forms
Abstract
In this paper we deal with transient analysis of networks of queues. These systems most often have enormous state space and the exact computation of their transient behavior is not possible. We propose to apply an approximate technique based on assumptions on the structure of the transient probabilities. In particular, we assume that the transient probabilities of the model can be decomposed into a quasi product form. This assumption simplifies the dependency structure of the model and leads to a relatively small set of ordinary differential equations (ODE) that can be used to compute an approximation of the transient probabilities. We provide the derivation of this set of ODEs and illustrate the accuracy of the approach on numerical examples.
Cite
@inproceedings{angiusApproximateTransientAnalysisOf2013,
author = {Alessio Angius and András Horváth and Verena Wolf},
booktitle = {Analytical and Stochastic Modeling Techniques and Applications - 20th International Conference, Proceedings. International Conference on Analytical and Stochastic Modeling Techniques and Applications (ASMTA-2013), July 8-10, Ghent, Belgium},
doi = {10.1007/978-3-642-39408-9_3},
editor = {Alexander Dudin and Koen De Turck},
isbn = {9783642394089},
pages = {22-36},
publisher = {Springer},
series = {Lecture Notes in Computer Science, LNCS},
title = {Approximate Transient Analysis of Queuing Networks by Quasi Product Forms},
url = {https://link.springer.com/chapter/10.1007/978-3-642-39408-9_3},
volume = {7984},
year = {2013}
}