The Markov-modulated Poisson process (MMPP) cookbook
Performance Evaluation
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Analysis of web caching architectures: hierarchical and distributed caching
IEEE/ACM Transactions on Networking (TON)
Mechanisms for quality of service in Web clusters
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on networking middleware: selected papers from the TERENA networking conference 2001
IEEE Internet Computing
Spectral Expansion Solutions for Markov-Modulated Queues
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Sojourn Time Distributions in Modulated G-Queues with Batch Processing
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Delay Analysis of Priority Queues with Modulated Traffic
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Modeling job arrivals in a data-intensive grid
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
ACES: An efficient admission control scheme for QoS-aware web servers
Computer Communications
Hi-index | 0.00 |
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, 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 agreed dependability levels in case of, e.g. request redirection due to faults. Finally, the effectiveness of the proposed approximate solution method is evaluated for a real-world case study relying on a trace-based traffic characterisation of a Grid server.