Abstract
In this paper we consider an M/G/1 queueing model, in which each customer is fed back a fixed number of times. For the case of negative exponentially distributed service times at each visit, we determine the Laplace-Stieltjes transform of the joint distribution of the sojourn times of the consecutive visits. As a by-result, we obtain the (transform of the) total sojourn time distribution; it can be related to the sojourn time distribution in the M/D/l queue with processor sharing. For the case of generally distributed service times at each visit, a set of linear equations is derived, from which the mean sojourn times per visit can be calculated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
