Name
Abstract | ||
|---|---|---|
This paper presents a new algorithm to simulate multiple vacations Geo/G/1 queue with Bernoulli gate service model. Firstly, we deduce the probability generating function (P.G.F.) of stationary queue length by using regeneration cycle method, and get the (P.G.F.) of stationary waiting time according to the service order FCFS. Then we get the (P.G.F.) of mean service cycle and the probability of various system state. The simulation results demonstrate that the new algorithm is relatively efficient and realized in real system. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.amc.2008.06.001 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Discrete time queue,Bernoulli gated service,Regeneration cycle,Service cycle | D/M/1 queue,M/M/1 queue,M/D/1 queue,Mathematical optimization,Bulk queue,G/G/1 queue,M/M/c queue,M/G/1 queue,Algorithm,M/G/k queue,Real-time computing,Mathematics | Journal |
Volume | Issue | ISSN |
204 | 1 | 0096-3003 |
Citations | PageRank | References |
2 | 0.37 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qingzhen Xu | 1 | 26 | 4.69 |
| Zhanyou Ma | 2 | 3 | 4.11 |