The Markov Modulated Poisson Process (MMPP) has been shown to well describe the flow of incoming traffic in networked systems, such as the GRID and the WWW. This makes the MMPP/M/1 queue a valuable instrument to evaluate and predict the service level of networked servers. In a recent work we have provided an approximate solution for the response time distribution of the MMPP/M/1 queue, which is based on a weighted superposition of M/M/1 queues (i.e. a hyper-exponential process). In this article we address the tradeoff between the accuracy of this approximation and its computational cost. By jointly considering both accuracy and cost, we identify the scenarios where such approximate solution could be effectively used in support of network servers (dynamic) configuration and evaluation strategies, aimed at ensuring the agreed dependability levels in case of, e.g., request redirection due to faults. ©2008 IEEE.
Accuracy vs efficiency of hyper-exponential approximations of the response time distribution of MMPP/M/1 queues / Romano, Paolo; Ciciani, Bruno; Andrea, Santoro; Quaglia, Francesco. - (2008), pp. 1-8. (Intervento presentato al convegno IPDPS 2008 - 22nd IEEE International Parallel and Distributed Processing Symposium tenutosi a Miami; United States nel 14 April 2008 through 18 April 2008) [10.1109/ipdps.2008.4536153].
Accuracy vs efficiency of hyper-exponential approximations of the response time distribution of MMPP/M/1 queues
ROMANO, Paolo;CICIANI, Bruno;QUAGLIA, Francesco
2008
Abstract
The Markov Modulated Poisson Process (MMPP) has been shown to well describe the flow of incoming traffic in networked systems, such as the GRID and the WWW. This makes the MMPP/M/1 queue a valuable instrument to evaluate and predict the service level of networked servers. In a recent work we have provided an approximate solution for the response time distribution of the MMPP/M/1 queue, which is based on a weighted superposition of M/M/1 queues (i.e. a hyper-exponential process). In this article we address the tradeoff between the accuracy of this approximation and its computational cost. By jointly considering both accuracy and cost, we identify the scenarios where such approximate solution could be effectively used in support of network servers (dynamic) configuration and evaluation strategies, aimed at ensuring the agreed dependability levels in case of, e.g., request redirection due to faults. ©2008 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.