We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
Boualem, M., Djellab, N., & Aïssani, D. (2014). Stochastic bounds for a single server queue with general retrial times. Bulletin of the Iranian Mathematical Society, 40(1), 183-198.
MLA
Boualem, M., Djellab, N., & Aïssani, D. "Stochastic bounds for a single server queue with general retrial times", Bulletin of the Iranian Mathematical Society, 40, 1, 2014, 183-198.
HARVARD
Boualem M., Djellab N., Aïssani D. (2014). 'Stochastic bounds for a single server queue with general retrial times', Bulletin of the Iranian Mathematical Society, 40(1), pp. 183-198.
CHICAGO
M. Boualem, N. Djellab & D. Aïssani, "Stochastic bounds for a single server queue with general retrial times," Bulletin of the Iranian Mathematical Society, 40 1 (2014): 183-198,
VANCOUVER
Boualem M., Djellab N., Aïssani D. Stochastic bounds for a single server queue with general retrial times. BIMS. 2014;40(1):183-198.
