Waiting time distribution of a queueing system with postservice activity
β Scribed by Ken'ichi Kawanishi
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 535 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we consider a queueing system with postservice activity. During the time when the server is engaged in the postservice activity (wrap-up time), the waiting customer, if any, cannot receive his or her service. This type of queueing system has been used to model automatic call distribution (ACD) systems. We consider the waiting time distribution of the queueing system. Using the Markovian point process that can be expressed by the so-called Markovian arrival process (MAP), we derive the waiting time distribution in terms of the representing matrices of a particular MAP. Then we apply the Baker-Hausdorff lemma to the matrices and derive the conditional waiting time distribution in closed form by exploiting the specific structure of the matrices. As a byproduct, we give an explicit solution of the number of arrivals for the MAP. @
π SIMILAR VOLUMES
## Abstract The determination of steadyβstate characteristics in systems of tandem queues has been left to computer simulation because of the lack of exact solutions in all but the simplest newtorks. In this paper, several methods developed for approximating the average waiting time in singleβserve
A loop transmission system consisting of a central station, N input terminals with infinite buffer, and a multiplexed channel is considered. Data flows from the terminals to the central station and from the central station to the terminals. The first type of data transfer is accorded priority over t