Abstract
This paper investigates the asymptotic behaviour of the loss probability of theM / G/1/K and G/M/1/K queues as the buffer size increases. It is shown that the loss probability approaches its limiting value, which depends on the offered load, with an exponential decay in essentially all cases. The value of the decay rate can be easily computed from the main queue parameters. Moreover, the close relation existing between the loss behaviour of the two examined queueing systems is highlighted and a duality concept is introduced. Finally some numerical examples are given to illustrate on the usefulness of the asymptotic approximation.
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.
