Abstract
We study a finite sources retrial queue with deterministic service times using an approach based on the theory of Markov regenerative process. A Deterministic Stochastic Petri Net DSPN model which copes with the complexity of this queue is given. For the steady state of this model, we construct the one-step transition probability matrix of Embedded Markov Chain (EMC) and the conversion matrix. We establish an algorithm based on the theoretic results obtained in order to compute efficiently various performance measures and to study the effect of system parameter’s on the characteristics of the M/D/1/N/N retrial queue.
Reference18 articles.
1. Cox DR. The analysis of non-markovian stochastic processes by the inclusion of supplementary variables. Mathematical Proceedings of the Cambridge Philosophical Society. 1955;(9):433-441. DOI: 10.1017/S0305004100030437
2. Cumani A. ESP-A package for the evaluation of stochastic Petri nets with phase-type distributed transition times. In International Workshop on Timed Petri Nets. IEEE Computer Society, Washington, DC, USA. 1985. pp. 144–151
3. Choi H, Kulkarni VG, Trivedi KS. Transient analysis of deterministic and stochastic Petri nets. The 14th International Conference on Application and Theory of Petri Nets, Chicago, U.S.A. 1993. pp. 21-25
4. Bunday BD. Basic Queueing Theory. Australia: Edward Arnold; 1986
5. Kashyap BRK, Chaudhry ML. An Introduction to Queueing Theory, A & A Publications. Ontario, Canada: Kingston; 1988