Busy Period Analysis of $$\textit{GI/G/c}$$GI/G/c and $$\textit{MAP/G/c}$$MAP/G/c Queues

Chakravarthy, Srinivas

doi:10.1007/978-981-13-0857-4_1

Cited by 1 publication

(1 citation statement)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…MAPs are widely used in the existing works on building traffic models [17,20] and workload characterization [7], due to the ability to capture the burstiness and correlated traffic features. There are also some analytical studies on the queueing system with MAP arrivals, in which the authors work with MAP/G/K queues [10,19]. To capture different types of correlated arrivals, Buchholz et al [6] extend single MAP to multiclass MAP with marked arrivals and provide the parameter fitting method.…”

Section: Related Workmentioning

confidence: 99%

Estimating Multiclass Service Demand Distributions Using Markovian Arrival Processes

Wang

Casale

Filieri

2023

ACM Trans. Model. Comput. Simul.

View full text Add to dashboard Cite

Building performance models for software services in DevOps is costly and error-prone. Accurate service demand distribution estimation is critical to precisely modeling queueing behaviors and performance prediction. However, current estimation methods focus on capturing the mean service demand, disregarding higher-order moments of the distribution that still can largely affect prediction accuracy. To address this limitation, we propose to estimate higher moments of the service demand distribution for a microservice from monitoring traces. We first generate a closed queueing model to abstract software performance and use it to model the departure process of requests completed by the software service as a Markovian arrival process. This allows formulating the estimation of service demand into an optimization problem, which aims to find the first multiple moments of the service demand distribution that maximize the likelihood of the MAP using generated the measured inter-departure times. We then estimate the service demand distribution for different classes of service with a maximum likelihood algorithm and novel heuristics to mitigate the computational cost of the optimization process for scalability. We apply our method to real traces from a microservice-based application and demonstrate that its estimations lead to greater prediction accuracy than exponential distributions assumed in traditional service demand estimation approaches for software services.

show abstract