| Article ID: | iaor20002498 |
| Country: | United States |
| Volume: | 25 |
| Issue: | 1/4 |
| Start Page Number: | 281 |
| End Page Number: | 305 |
| Publication Date: | Jun 1997 |
| Journal: | Queueing Systems |
| Authors: | Sharma V., Gangadhar N.D. |
We consider a discrete time queue with finite capacity and independent identically distributed 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.