On the threshold of the M/M/1 processor-sharing queue
碩士 === 國立東華大學 === 應用數學系 === 90 === For the single-class queue under first-come-first-serve, Naor [1969] showed that the queue length under overall optimization is less than or equal to that under self optimization. In this study, we extend the scope of Naor's research to the system with multipl...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/24737617273868356252 |