Name
Abstract | ||
|---|---|---|
The processor-sharing (PS) rule arises as a natural paradigm in a variety of practical situations, including time-shared computer systems. Although there has been much work on Poisson-input queueing analysis for the PS rule, there have been few results for renewal-input GI/G/1 (PS) systems. We consider the GI/G/1 (PS) system to provide develop a two-moment approximation for the mean performance measures. We derive the relationship between the mean unfinished work and the conditional mean sojourn time for the GI/G/1 (PS) system. Using this relationship, we derive approximate formulas for the mean conditional sojourn time, mean sojourn time, and the mean number of customers in the GI/G/1 (PS) system. Numerical examples are presented to compare the approximation with exact and simulated results. We show that the proposed approximate formulas have good accuracy. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1587/transcom.E94.B.2247 | IEICE TRANSACTIONS ON COMMUNICATIONS |
Keywords | DocType | Volume |
queues, tele-traffic analysis, unfinished-work, sojourn-tune, processor-sharing, renewal input | Journal | E94B |
Issue | ISSN | Citations |
8 | 0916-8516 | 1 |
PageRank | References | Authors |
0.41 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kentaro Hoshi | 1 | 5 | 1.17 |
| Yoshiaki Shikata | 2 | 4 | 2.98 |
| Yoshitaka Takahashi | 3 | 4 | 2.31 |
| Naohisa Komatsu | 4 | 68 | 12.42 |