Name
Abstract | ||
|---|---|---|
This paper considers the sojourn time distribution in a processor-sharing queue with a Markovian arrival process and exponential service times. We show a recursive formula to compute the complementary distribution of the sojourn time in steady state. The formula is simple and numerically feasible, and enables us to control the absolute error in numerical results. Further, we discuss the impact of the arrival process on the sojourn time distribution through some numerical examples. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0167-6377(03)00028-2 | Oper. Res. Lett. |
Keywords | Field | DocType |
sojourn time distribution,complementary distribution,absolute error,markovian arrival process (map),processor-sharing queue,markovian arrival process,arrival process,sojourn time,exponential service time,processor-sharing (ps),recursive formula,numerical result,exponential services,numerical example,steady state | Complementary distribution,Applied mathematics,Mathematical optimization,Exponential function,Computer science,Queue,M/G/1 queue,Real-time computing,Markovian arrival process,Steady state,Recursion,Approximation error | Journal |
Volume | Issue | ISSN |
31 | 5 | Operations Research Letters |
Citations | PageRank | References |
12 | 0.82 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hiroyuki Masuyama | 1 | 86 | 11.53 |
| Tetsuya Takine | 2 | 457 | 60.37 |