In this paper we study the transient and equilibrium distributions of the queue length for the M/G/1 queueing system with delay single server vacation.By the server busy period and the Laplace transformation we direct...In this paper we study the transient and equilibrium distributions of the queue length for the M/G/1 queueing system with delay single server vacation.By the server busy period and the Laplace transformation we directly obtain the recursion formula of the L transformation of the transient queue length distribution at any time t , as well as the recursion formula of the equilibrium distribution for calculating conveniently.Furthermore we obtain the stochastic decompositions of the queue length and waiting time in equilibrium.展开更多
Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results ...Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results about the recursive expressions of queue size distribution at different epoch （n＋, n, n-） are obtained. Furthermore the important relations between stationary queue size distribution at different epochs are discovered. The results are different from the relations given in M/G/1 queueing system. The model discussed in this paper can be widely applied in many kinds of communications and computer network.展开更多
In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the di...In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are directly obtained from the transient solution. As will be seen this paper provides a intuitive and elegant method for studying transient solutions for M/G/1 queues with single server.展开更多
基金This work was supported by the National Outstanding Youth Science Foundation ( 7972 50 0 2 ) andthe Nature Education Minister
文摘In this paper we study the transient and equilibrium distributions of the queue length for the M/G/1 queueing system with delay single server vacation.By the server busy period and the Laplace transformation we directly obtain the recursion formula of the L transformation of the transient queue length distribution at any time t , as well as the recursion formula of the equilibrium distribution for calculating conveniently.Furthermore we obtain the stochastic decompositions of the queue length and waiting time in equilibrium.
基金Supported by the National Natural Science Foundation of China (No.70871084)Scientific Research Fund of Southwestern University of Finance and Economicsthe Specialized Research Fund for the Doctoral Program of Higher Education of China (No.200806360001)
文摘Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results about the recursive expressions of queue size distribution at different epoch （n＋, n, n-） are obtained. Furthermore the important relations between stationary queue size distribution at different epochs are discovered. The results are different from the relations given in M/G/1 queueing system. The model discussed in this paper can be widely applied in many kinds of communications and computer network.
文摘In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are directly obtained from the transient solution. As will be seen this paper provides a intuitive and elegant method for studying transient solutions for M/G/1 queues with single server.
