Abstract
We consider a polling network with a single server that serves the queues in a cyclic order. Upon the completion of his service at queue i, a customer is routed to queue j with probability p i,j , or leaves the system with probability p i,0 . The service policy is branching-type. Using the limit theorem of a multi-type branching process with immigration, we derive the asymptotic behavior of joint queue lengths at polling epochs in the heavy traffic. With the help of heavy traffic averaging principle, the limit behavior of the mean waiting times is also presented.
Sign-in/Register to access full text options 
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.
