Abstract
A heterogeneous closed network with N one-server queues with finite capacity and one infinite-server queue is studied. A target application is bike-sharing systems. Heterogeneity is taken into account through clusters queues of which have the same parameters. Incentives to the customer to go to the least-loaded one-server queue between two chosen within a cluster are investigated. By mean-field arguments, the limiting queue length stationary distribution as N gets large is analytically tractable. Moreover, when all customers follow incentives, the probability that a queue is empty or full is approximated. Sizing the system to improve performance is achievable under this policy.
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.
