Answers are grounded in this paper and cite their sources.
Stochastic bounding provides upper and lower bounds on performance metrics in hybrid systems, suggesting improved resource management.
To address the increasing demand for computational and communication resources, modern networked systems often rely on heterogeneous servers, including those requiring setup times, such as virtual machines or servers, and others that are always active. In this paper, we model and analyze the performance of such hybrid systems using a level-dependent quasi-birth-and-death (LDQBD) process. Building upon an existing queueing model, we extend the analysis by considering scalable approximation methods. Since matrix analytic methods become computationally expensive in large-scale settings, we propose a stochastic bounding approach that derives upper and lower bounds for the stationary distribution, thereby significantly reducing computational cost. This approach further provides bounds on the performance metrics of the hybrid system.
No takes yet. Share an insight, caveat, or question.
Kawanishi et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: