Abstract
The model considered is a variation of the Hypercube model in which there are R distinguishable servers and N types of customers. We consider two interesting special cases—light and heavy traffic intensities—and use asymptotic techniques to derive policies for assigning servers to arriving customers which are optimal under these conditions. For light traffic, we show that it is optimal to assign the server with the smallest assignment cost while, for heavy traffic, we derive an efficient algorithm for finding the optimal 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.
