Name
Abstract | ||
|---|---|---|
Two related problems are analyzed and discussed:A queueing system that differs from the standard M/G/1 only in that at the end of a busy-period the server takes a sequence of vacations, inspecting the state of the queue at the end of each. When the length of the queue exceeds a predetermined level m it returns to serve the queue exhaustively.Two queues, with Poisson arrivals and general service-time distributions are attended by a single server. When the server is positioned at a certain queue it will serve the latter exhaustively, and at busy-period end will only switch to the other if the queue length there exceeds in size a predetermined threshold mi.The treatment combines analytic and numerical methods. Only steady-state results are presented. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1145/317499.317557 | SIGMETRICS |
Keywords | Field | DocType |
busy-period end,queue exhaustively,numerical method,single server,level m,certain queue,procrastinating server,general service-time distribution,poisson arrival,latter exhaustively,queue length,queueing system,mean value analysis,steady state | M/M/1 queue,M/D/1 queue,G/G/1 queue,Bulk queue,M/M/c queue,Computer science,M/G/1 queue,M/G/k queue,M/D/c queue,Real-time computing,Distributed computing | Conference |
Volume | Issue | ISBN |
14 | 1 | 0-89791-184-9 |
Citations | PageRank | References |
7 | 1.10 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Micha Hofri | 1 | 342 | 127.96 |