Lattice path counting andM/M/c queueing systems
暂无分享,去创建一个
[1] S. G. Mohanty,et al. Lattice Path Counting and Applications. , 1980 .
[2] Lajos Takács,et al. A Generalization of the Ballot Problem and its Application in the Theory of Queues , 1962 .
[3] Kanwar Sen,et al. Combinatorial approach to Markovian queueing models , 1993 .
[4] Thomas L. Saaty,et al. Time-Dependent Solution of the Many-Server Poisson Queue , 1960 .
[5] Lajos Takács,et al. A Single-Server Queue with Recurrent Input and Exponentially Distributed Service Times , 1962 .
[6] J. Medhi,et al. Stochastic models in queueing theory , 1991 .
[7] Lajos Takács,et al. A Combinatorial Method in the Theory of Queues , 1962 .
[8] Oj Onno Boxma. THE JOINT ARRIVAL AND DEPARTURE PROCESS FOR THE M/M/l QUEUE , 1984 .
[9] M. Sharafali,et al. Transient Solution to the Many Server Poisson Queue: A Simple Approach , 1989 .
[10] P. R. Parthasarathy. A transient solution to an M/M/1 queue: a simple approach , 1987, Advances in Applied Probability.
[11] Kanwar Sen,et al. Lattice path approach to transient solution of M/M/1 with (0,k) control policy , 1993 .
[12] S. G. Mohanty,et al. The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach , 1993 .
[13] D. G. Champernowne,et al. An Elementary Method of Solution of the Queueing Problem with a Single Server and Constant Parameters , 1956 .
[14] Carl M. Harris,et al. Fundamentals of queueing theory , 1975 .
[15] Matthew Rosenshine,et al. Some New Results for the M/M/1 Queue , 1982 .
[16] Don Towsley. An application of the reflection principle to the transient analysis of the M/M/1 queue , 1987 .