论文信息 - Dual processes to solve single server systems

Dual processes to solve single server systems

A new approach is used to determine the transient probability functions of the classical queueing systems: M/M/1, M/M/1/H, and M/M/1/H with catastrophes. This new solution method uses dual processes, randomization and lattice path combinatorics. The method reveals that the transient probability functions for M/M/1/H and M/M/1/H with catastrophes have the same mathematical form.

[1] G. F. Newell,et al. Introduction to the Theory of Queues. , 1963 .

[2] W. J. Anderson. Continuous-Time Markov Chains: An Applications-Oriented Approach , 1991 .

[3] Lajos Takács. On the Classical Ruin Problems , 1969 .

[4] Gerardo Rubino,et al. Transient analysis of the M/M/1 queue , 1993, Advances in Applied Probability.

[5] Rabi Bhattacharya,et al. Stochastic processes with applications , 1990 .

[6] S. G. Mohanty,et al. Lattice Path Counting and Applications. , 1980 .

[7] Walter Böhm,et al. The combinatorics of birth-death processes and applications to queues , 1997, Queueing Syst. Theory Appl..

[8] T. V. Narayana,et al. Lattice Path Combinatorics With Statistical Applications , 1979 .

[9] Antonis Economou,et al. A continuous-time Markov chain under the influence of a regulating point process and applications in stochastic models with catastrophes , 2003, Eur. J. Oper. Res..

[10] Carl M. Harris,et al. Fundamentals of queueing theory , 1975 .

[11] Gerardo Rubino,et al. Transient Probability Functions: A Sample Path Approach , 2003, DRW.

[12] Gerardo Rubino,et al. Connections Between Birth-Death Processes , 2003 .

[13] B. Krishna Kumar,et al. Transient solution of an M/M/1 queue with catastrophes , 2000 .