Analytical Models for Systems with Workload Burstiness


MAP Queueing Networks are a new class of closed queueing network models for the analysis of computer and communication systems where service times are affected by burstiness. Queueing network models can be used to forecast the utilization and response time of a system composed by several inter-operating components (servers, hardware devices) modeled as queues. In particular, real systems are often characterized by limited buffer sizes and this makes the class of closed queueing network a better abstraction of real systems than open models.

The Web page support the definition and the analysis of MAP queueing networks by providing software tools and resources (papers, examples). See the Download and the Publications sections.

For an introduction to MAP Queueing Networks see the Model and Examples sections.

This work has been supported by the National Science Foundation under grants ITR-0428330  and CNS-0720699.

The KPC-Toolbox is release under the BSD-3 license.

Latest News

MAP Queueing Network page online

May, 2008

Check it out!

Webdesign service by Sarkis. Outsourcing by FreelanceWebmarket.