Year-end Sale % OFF 
Abstract
A generalization of the GI/G/1 queue is considered where the service time of the nth customer and the inter-arrival time between arrivalsn andn+1 may be dependent random variables. New proofs are obtained of finite moment conditions for busy periods and the ladder epochs of a corresponding random walk. The method of proof, which is much different from the usual ones, directly relates busy period moments to virtual and actual delay moments.
Published Version
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.
