By Topic

A Phase-Type Representation for the Queue Length Distribution of a Semi-Markovian Queue

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Benny Van Houdt ; Dept. of Math. & Comput. Sci., Univ. of Antwerp, Antwerp, Belgium

In this paper we study a broad class of semi-Markovian queues introduced by Sengupta. This class contains many classical queues such as the GI/M/1 queue, SM/MAP/1 queue and others, as well as queues with correlated inter-arrival and service times. Queues belonging to this class are characterized by a set of matrices of size m and Sengupta showed that its waiting time distribution can be represented as a phase-type distribution of order m. For the special case of the SM/MAP/1 queue without correlated service and inter-arrival times the queue length distribution was also shown to be phase-type of order m, but no derivation for the queue length was provided in the general case. This paper introduces an order m2 phase-type representation (kappa, K) for the queue length distribution in the general case. Moreover, we prove that the order m2 of the distribution cannot be further reduced in general. Examples for which the order is between m and m2 are also identified. We derive these results in both discrete and continuous time and also discuss the numerical procedure to compute (kappa, K). Moreover, by combining a result of Sengupta and Ozawa, we provide a simple formula to compute the order m phase-type representation of the waiting time in a MAP/MAP/1 queue without correlated service and inter-arrival times, using the R matrix of a Quasi-Birth-Death Markov chain.

Published in:

Quantitative Evaluation of Systems (QEST), 2010 Seventh International Conference on the

Date of Conference:

15-18 Sept. 2010