toTop
If you have any feedback, Please follow the official account to submit feedback.
Turn on your phone and scan
We consider the loss probability in the stationary M/G/1 queue with generally distributed impatience times (M/G/1+G queue). Recently, it was shown that increases with service times in the convex order. In this paper, we show that also increases with impatience times in the excess wealth order. With these results, we show that 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.
If you wish to continue, please create your membership or download this.
Create MembershipThis function is a member function, members do not limit the number of downloads