Maximum Likelihood Estimation of Closed Queueing Network Demands from Queue Length Data
Author(s) -
Weikun Wang,
Giuliano Casale,
Ajay Kattepur,
Manoj Nambiar
Publication year - 2016
Publication title -
spiral (imperial college london)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/2851553.2851565
Subject(s) - estimator , computer science , queueing theory , layered queueing network , queue , bulk queue , maximum likelihood , real time computing , mathematical optimization , computer network , statistics , mathematics
Resource demand estimation is essential for the application of analyical models, such as queueing networks, to real-world systems. In this paper, we investigate maximum likelihood (ML) estimators for service demands in closed queueing networks with load-independent and load-dependent service times. Stemming from a characterization of necessary conditions for ML estimation, we propose new estimators that infer demands from queue-length measurements, which are inexpensive metrics to collect in real systems. One advantage of focusing on queue-length data compared to response times or utilizations is that confidence intervals can be rigorously derived from the equilibrium distribution of the queueing network model. Our estimators and their confidence intervals are validated against simulation and real system measurements for a multi-tier application
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom