Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Workload and Waiting Time Analyses of MAP/G/1 Queue under D-policy
| |
|
Workload and Waiting Time Analyses of MAP/G/1 Queue under D-policy Ho Woo Lee1  , Sahng Hoon Cheon1, Eui Yong Lee2 and K.C. Chae3 | (1) | Department of Systems Management Engineering, Sungkyunkwan University, Su Won, Korea (South) |
| (2) | Department of Statistics, Sookmyung Women's University, Seoul, Korea (South) |
| (3) | Department of Industrial Engineering, KAIST, Taejon, Korea (South) |
Abstract We study the workload (unfinished work) and the waiting time of the queueing system with MAP arrivals under D-policy. The D-policy stipulates that the idle server begin to serve the customers only when the sum of the service times of all waiting customers exceeds some fixed threshold D. We first set up the system equations for workload and obtain the steady-state distributions of workloads at an arbitrary idle and busy points of time. We then proceed to obtain the waiting time distribution of an arbitrary customer based on the workload results. The M/G/1/ D-policy queue will be investigated as a special case. MAP/G/1 -
D-policy - workload - waiting time
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|