Consider a 2-stage single-server tandem queue with a MAP to the first stage and the ex- ponential service times. Using the DREB scheme, we formulate the joint queue length process into a single-dimensional level-dependent quasi-birth-death (LDQBD) process with expanding blocks. This allows us to show that the departure process from stage 1 is a MAP with infinite phases or IMAP and that the departure process of any IMAP/M/1 is still an IMAP. We consider a two-stage tandem queueing network. Each stage has a single expo- nential server with an unlimited input buffer. Customers arrive to stage 1 following a Markovian arrival process (MAP). Using the DREB formulation scheme, Lian and Liu (1) construct a single-dimensional level-dependent quasi-birth-death (LDQBD) process with expanding blocks to study the queue length processes and the system sojourn time process. In this paper, we study the busy period and idle period in stage 2. We also study the departure process from each stage. To do this, we introduce a useful arrival process, the IMAP, which stands for infinite dimensional Markov arrival process. MAP with an infinite dimension has not been formally studied in the literature, although it has appeared in a number of works including Sadre and Havercourt (2), Miyazawa (3), Miyazawa and Zhao (4), and Zhang, Heindl, and Smirni (5). One interesting work is by Green (6) on the output process from a MAP/M/1 queue. He finds a set of conditions on the input MAP under which the output process is still a MAP (with a finite dimension). Though in general, the departure process of an MAP/M/1 queue is not a finite MAP, Green restricts his study to the finite cases only. We pick up from where Green left untouched. We found that an IMAP arises naturally as the departure process of a MAP/M/1 queue (Theorem 1), and certain properties of the IMAP are important and are very helpful to queueing analysis. For example, the fact that the departure process from an IMAP/M/1 queue is still an IMAP (Theorem 2) shows that IMAP has good closure properties. As such, it is natural and important to define and discuss IMAP formally. This paper is organized as follows. In Section 2, we define the 2-station tandem net- work. In Section 3, we define IMAP and show that the departure process from IMAP/M/1 is still an IMAP. We conclude the paper in Section 4.
[1]
Liming Liu,et al.
A tandem network with MAP inputs
,
2008,
Oper. Res. Lett..
[2]
Ramin Sadre,et al.
Flows in Networks of MAP/MAP/1 Queues
,
2001,
MMB.
[3]
Yiqiang Q. Zhao,et al.
The stationary tail asymptotics in the GI/G/1-type queue with countably many background states
,
2004,
Advances in Applied Probability.
[4]
Evgenia Smirni,et al.
Characterizing the BMAP/MAP/1 Departure Process via the ETAQA Truncation
,
2005
.
[5]
David Green,et al.
Departure processes from MAP/PH/1 queues
,
1999
.
[6]
Marcel F. Neuts,et al.
Matrix-Geometric Solutions in Stochastic Models
,
1981
.
[7]
Sheldon M. Ross,et al.
Stochastic Processes
,
2018,
Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.