By Topic

ETAQA truncation models for the MAP/MAP/1 departure process

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

3 Author(s)
A. Heindl ; Comput. Networks & Commun. Syst., Erlangen-Nurnberg Univ., Erlangen, Germany ; Q. Zhang ; E. Smirni

We propose a family of finite approximations for the departure process of a MAP/MAP/1 queue. The departure process approximations are derived via an exact aggregate solution technique (called ETAQA) applied to quasi-birth-death processes (QBDs) and require only the computation of the frequently sparse fundamental-period matrix G. The approximations are indexed by a parameter n, which determines the size of the output model as n-1 QBD levels. The marginal distribution of the true departure process and the lag correlations of the interdeparture times up to lag n+1 are preserved exactly. Via experimentation we show the applicability of the proposed approximation in traffic-based decomposition of queueing networks and investigate how correlation propagates through tandem queues.

Published in:

Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings. First International Conference on the

Date of Conference:

27-30 Sept. 2004