Learning queuing networks by recurrent neural networks

19Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It is well known that building analytical performance models in practice is difficult because it requires a considerable degree of proficiency in the underlying mathematics. In this paper, we pro- pose a machine-learning approach to derive performance models from data. We focus on queuing networks, and crucially exploit a deterministic approximation of their average dynamics in terms of a compact system of ordinary differential equations. We encode these equations into a recurrent neural network whose weights can be directly related to model parameters. This allows for an inter- pretable structure of the neural network, which can be trained from system measurements to yield a white-box parameterized model that can be used for prediction purposes such as what-if analyses and capacity planning. Using synthetic models as well as a real case study of a load-balancing system, we show the effectiveness of our technique in yielding models with high predictive power.

Cite

CITATION STYLE

APA

Garbi, G., Incerto, E., & Tribastone, M. (2020). Learning queuing networks by recurrent neural networks. In ICPE 2020 - Proceedings of the ACM/SPEC International Conference on Performance Engineering (pp. 56–66). Association for Computing Machinery, Inc. https://doi.org/10.1145/3358960.3379134

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free