Abstract
A loss system with N servers, two types of customers, exponential service times, and Poisson arrivals is considered. Customers of class i generate a reward r/sub i/ when they enter service (r/sub 1/>r/sub 2/). The optimal policy has a threshold form known as trunk reservation. The behavior of the optimal trunk reservation level as N to infinity is considered, and it is shown that in a case of practical interest it grows as square root N. The approximation to the optimal trunk reservation level obtained from the asymptotic analysis works extremely well. >
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.
