Abstract
This paper considers the MAP/G/1 queue under N‐policy with a single vacation and set‐up. We derive the vector generating functions of the queue length at an arbitrary time and at departures in decomposed forms. We also derive the Laplace‐Stieltjes transform of the waiting time. Computation algorithms for mean performance measures are provided.
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.
