|
|||||
|
|
Some algorithms for discrete time queues with finite capacity |
|
| Authors: | Vinod Sharma Nandyala D. Gangadhar |
| Abstract: | We consider a discrete time queue with finite capacity and i.i.d. and Markov modulated arrivals. Efficient algorithms are developed to calculate the moments and the distributions of the first time to overflow and the regeneration length. Results are extended to the multiserver queue. Some illustrative numerical examples are provided. This revised version was published online in June 2006 with corrections to the Cover Date. |
| Keywords: | finite capacity queue discrete time queue algorithms overflow time regeneration cycle length probability of overflow Markov modulated arrivals |
| 本文献已被 SpringerLink 等数据库收录！ | |