Marked Markovian Arrivals in a Tandem G-Network with Blocking

A. Gómez-Corral () and M. E. Martos ()
Additional contact information
A. Gómez-Corral: Complutense University of Madrid
M. E. Martos: Complutense University of Madrid

Methodology and Computing in Applied Probability, 2009, vol. 11, issue 4, 621-649

Abstract: Abstract Queueing networks with blocking have broad applications in computer modelling and manufacturing. The present paper focusses on the MMAP[2]/M/1/ ∞ →·/M/1/K + 1 G-queue with blocking. This network consists of a sequence of two single-server stations with an infinite queue allowed before the first server and an intermediate queue of finite capacity K ≥ 0 allowed between servers. This restriction results in the blocking of the first server whenever a unit having completed its service in Station 1 cannot enter into Station 2 due to K + 1 units are accommodated into Station 2. There are two types of arrivals, called units and signals, which are modelled by a single Markovian arrival process with marked transitions. Each unit is served at Stations 1 and 2 in that order, and then it exits of the network. A signal induces the last unit in queue or in service, if there is one, to leave the network instantly, and it has no effect otherwise. Our purpose is to study the influence of the dependence between units and signals on the performance evaluation of the continuous-time Markov chain describing the state of the network at arbitrary times, which constitutes a quasi-birth-and-death process. We present tractable formulas for a variety of probabilistic descriptors, with special emphasis on the distribution of inter-departure times.

Keywords: Blocking; Marked Markovian arrival process; PH distribution; Quasi-birth-and-death process; Tandem queue; Primary 60K25; Secondary 68M20, 90B22 (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11009-008-9080-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:11:y:2009:i:4:d:10.1007_s11009-008-9080-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1007/s11009-008-9080-8

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().