Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers |
| |
Institution: | Department of Statistics, University of Seoul, Seoul, 130-743, Republic of Korea |
| |
Abstract: | We consider a two-class processor sharing queueing system with impatient customers. The system operates under the discriminatory processor sharing (DPS) scheduling. The arrival process of each class customers is the Poisson process and the service requirement of a customer is exponentially distributed. The reneging rate of a customer is a constant. To analyze the performance of the system, we develop a time scale decomposition approach to approximate the joint queue-length distribution of each class customers. Via a numerical experiment, we show that the time scale decomposition approach gives a fairly good approximation of the queue-length distribution and the expected queue length. |
| |
Keywords: | Queue length distribution Impatient customers Discriminatory processor sharing Time scale decomposition method |
本文献已被 ScienceDirect 等数据库收录! |