DocumentCode
1556972
Title
Loss probability calculations and asymptotic analysis for finite buffer multiplexers
Author
Kim, Han S. ; Shroff, Ness B.
Author_Institution
Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA
Volume
9
Issue
6
fYear
2001
fDate
12/1/2001 12:00:00 AM
Firstpage
755
Lastpage
768
Abstract
We propose an approximation for the loss probability, PL(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 result 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
Keywords
Gaussian processes; approximation theory; buffer storage; losses; multiplexing; multiplexing equipment; probability; queueing theory; Gaussian input process; admission control; asymptotic analysis; asymptotic properties; buffer size; central limit theorem; finite buffer multiplexers; general Gaussian process; high-speed network; infinite buffer system; loss probability approximation; maximum variance asymptotic approximation; queue length distribution; tail probability; Communication networks; Convergence; Gaussian processes; High-speed networks; Intelligent networks; Multiplexing; Probability distribution; Tail; Upper bound;
fLanguage
English
Journal_Title
Networking, IEEE/ACM Transactions on
Publisher
ieee
ISSN
1063-6692
Type
jour
DOI
10.1109/90.974529
Filename
974529
Link To Document