Abstract
In this paper, we propose an approximation for the loss probability, P L(x), in a finite buffer system with buffer size x. Our study is motivated by the case of a high-speed network where a large number of sources are expected to be multiplexed. Hence, by appealing to Central Limit Theorem type of arguments, we model the input process as a general Gaussian process. Our results is obtained by making a simple mapping from the tail probability in an infinite buffer system to the loss probability in a finite buffer system. We also provide a strong asymptotic relationship between our approximation and the actual loss probability for a fairly large class of Gaussian input processes. We derive some interesting asymptotic properties of our approximation and illustrate its effectiveness via a detailed numerical investigation.
Author supplied keywords
Cite
CITATION STYLE
Kim, H. S., & Shroff, N. B. (2001). Loss probability calculations and asymptotic analysis for finite buffer multiplexers. IEEE/ACM Transactions on Networking, 9(6), 755–768. https://doi.org/10.1109/90.974529
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.