Abstract
Although the cμ-rule is proven to be exactly or asymptotically optimal in various parallel queueing networks, its performance in non-parallel queueing networks is relatively unexplored. We study the performance of the cμ-rule (that is, the performance of implementing the cμ-rule at all servers) in non-parallel queueing networks. We numerically show that the cμ-rule can perform poorly even in a simple tandem queue with two job types. We derive conditions under which the cμ-rule is asymptotically optimal in diffusion scale.
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.
