A joint moments based analysis of networks of MAP/MAP/1 queues

Authors:
András Horváth;Gábor Horváth;Miklós Telek
Affiliations:
Dipartimento di Informatica, Universití di Torino, Torino, Italy;Department of Telecommunications, Budapest University of Technology and Economics, H-1521 Budapest, Hungary;Department of Telecommunications, Budapest University of Technology and Economics, H-1521 Budapest, Hungary
Venue:
Performance Evaluation
Year:
2010

Citing 7
Cited 1

Topics in matrix analysis

Topics in matrix analysis
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
ETAQA Truncation Models for the MAP/MAP/1 Departure Process

QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation)

Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation)
Bounding stationary results of Tandem networks with MAP input and PH service time distributions

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Structured Markov chains solver: software tools

SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
A minimal representation of Markov arrival processes and a moments matching method

Performance Evaluation

Departure process analysis of the multi-type MMAP[K]/PH[K]/1 FCFS queue

Performance Evaluation

Quantified Score

Hi-index	0.01

Visualization

Abstract

The decomposition based approximate numerical analysis of queueing networks of MAP/MAP/1 queues with FIFO scheduling is considered in this paper. One of the most crucial decisions of decomposition based queueing network analysis is the description of inter-node traffic. Utilizing recent results on Markov arrival processes (MAPs), we apply a given number of joint moments of the consecutive inter-event times to describe the inter-node traffic. This traffic description is compact (uses far less parameters than the alternative methods) and flexible (allows an easy reduction of the complexity of the model). Numerical examples demonstrate the accuracy and the computational complexity of the proposed approximate analysis method.