Overflow and loss probabilities in a finite ATM buffer fed by self-similar traffic

Real-time measurements from LANs, variable-bit-rate video sources, ISDN control-channels, the World Wide Web and other communication systems have shown that traffic exhibits a behaviour of self-similar nature. In this paper, we give new lower bounds to buffer-overflow and cell-loss probabilities for an ATM queue system with a self-similar cell input traffic and finite buffer. The bounds are better than those previously obtained in an important region of parameters. They decay hyperbolically with buffer size, when the latter goes to infinity. However, in some region, a factor which accompanies the decay is higher.