Advances in Applied Probability
- Adv. in Appl. Probab.
- Volume 42, Number 1 (2010), 210-225.
On the dual relationship between Markov chains of GI/M/1 and M/G/1 type
In 1990, Ramaswami proved that, given a Markov renewal process of M/G/1 type, it is possible to construct a Markov renewal process of GI/M/1 type such that the matrix transforms G(z, s) for the M/G/1-type process and R(z, s) for the GI/M/1-type process satisfy a duality relationship. In his 1996 PhD thesis, Bright used time reversal arguments to show that it is possible to define a different dual for positive-recurrent and transient processes of M/G/1 type and GI/M/1 type. Here we compare the properties of the Ramaswami and Bright dual processes and show that the Bright dual has desirable properties that can be exploited in the design of algorithms for the analysis of Markov chains of GI/M/1 type and M/G/1 type.
Adv. in Appl. Probab. Volume 42, Number 1 (2010), 210-225.
First available in Project Euclid: 26 March 2010
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Taylor, P. G.; Van Houdt, B. On the dual relationship between Markov chains of GI/M/1 and M/G/1 type. Adv. in Appl. Probab. 42 (2010), no. 1, 210--225. doi:10.1239/aap/1269611150. https://projecteuclid.org/euclid.aap/1269611150.