REAL

Commuting matrices in the sojourn time analysis of MAP/MAP/1 queues

Horváth, Gábor and Telek, Miklós and Van Houdt, Benny (2014) Commuting matrices in the sojourn time analysis of MAP/MAP/1 queues. In: Matrix Analytic Methods in Stochastic Models: MAM8, 2014.01.08-2014.01.10, Kerala, India.

[img]
Preview
Text
fcfswt_discrete2.pdf

Download (295kB) | Preview

Abstract

Queues with Markovian arrival and service processes, i.e., MAP/MAP/1 queues, have been useful in the analysis of computer and communication systems and different representations for their sojourn time distribution have been derived. More specifically, the class of MAP/MAP/1 queues lies at the intersection of the class of QBD queues and the class of semi-Markovian queues. While QBD queues have an order $N^2$ matrix exponential representation for their sojourn time distribution, where $N$ is the size of the background continuous time Markov chain, the sojourn time distribution of the latter class allows for a more compact representation of order $N$. In this paper we unify these two results and show that the key step exists in establishing the commutativity of some fundamental matrices involved in the analysis of the MAP/MAP/1 queue. We prove, using two different approaches, that the required matrices do commute and identify several other sets of commuting matrices. Finally, we generalize some of the results to queueing systems with batch arrivals and services.

Item Type: Conference or Workshop Item (Paper)
Subjects: T Technology / alkalmazott, műszaki tudományok > T2 Technology (General) / műszaki tudományok általában
Depositing User: Gábor Horváth
Date Deposited: 23 Sep 2014 00:28
Last Modified: 23 Sep 2014 00:28
URI: http://real.mtak.hu/id/eprint/15876

Actions (login required)

Edit Item Edit Item