Abstract
We consider the loss probability Ploss in the stationary M/G/1 queue with generally distributed impatience times (M/G/1+G queue). Recently, it was shown that Ploss increases with service times in the convex order. In this paper, we show that Ploss also increases with impatience times in the excess wealth order. With these results, we show that Ploss in the M/D/1+D queue is smallest among all M/G/1+G queues with the same and finite arrival rate, mean service time, and mean impatience time.
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.
