Abstract
The authors establish the extremal properties of the shortest nonfull queue (SNQ) and the longest nonfull queue (LNQ) policies, in systems with finite buffer capacities and exponentially distributed state-dependent service times, which are concave or convex functions of the queue lengths. They also solve the buffer allocation problem, which is the problem of how to distribute a number of buffers among the queues. >
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.
