We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Workload and busy period for $$M/GI/1$$ with a general impatience mechanism.
- Authors
Brandt, Andreas; Brandt, Manfred
- Abstract
The paper deals with the workload and busy period for the $$M/GI/1$$ system with impatience under FCFS discipline. The customers may become impatient during their waiting for service with generally distributed maximal waiting times and also during their service with generally distributed maximal service times depending on the time waited for service. This general impatience mechanism was originally introduced by Kovalenko () and considered by Daley (), too. It covers the special cases of impatience on waiting times as well as impatience on sojourn times, for which Boxma et al. (, ) gave new results and outlined special cases recently. Our unified approach bases on the vector process of workload and busy time. Explicit representations for the LSTs of workload and busy period are given in case of phase-type distributed impatience.
- Subjects
WORKLOAD of computer networks; CUSTOMER services; CONSUMER behavior; DISTRIBUTION (Probability theory); LOCAL times (Stochastic processes)
- Publication
Queueing Systems, 2013, Vol 75, Issue 2-4, p189
- ISSN
0257-0130
- Publication type
Article
- DOI
10.1007/s11134-013-9373-7