A central question in designing server farms today is how to efficiently provision the number of servers to extract the best performance under unpredictable demand patterns while ...
Anshul Gandhi, Varun Gupta, Mor Harchol-Balter, Mi...
In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which custom...
Marko A. A. Boon, Ivo J. B. F. Adan, Onno J. Boxma
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Performance prediction and measurement approaches for component-based software systems help software architects to evaluate their systems based on component performance specificat...
We introduce a new framework supporting the bottleneck analysis of closed, multiclass BCMP queueing networks in the limiting regime where the number of jobs proportionally grows t...