Abstract
An analysis is made of polling systems with correlated arrivals, namely, systems in which the arrival processes of customers to the queues are not assumed to be independent. The authors consider cyclic polling systems with N queues, general service time distribution in each queue, and general switch-over times. For both the exhaustive and the gated service disciplines they derive the necessary equations for computing the N expected waiting time figures. A 'pseudo' conservation law for these systems is also derived. The analysis approach can be applied to other polling systems with correlated arrivals.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
