Buffer overflow under self-similar packet traffic
Boris Tsybakov, Nicolas D. Georganas · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1999
Actual measurements of high-speed traffic in communications networks argue convincingly that self-similar stochastic processes should model it. These measurements have also revealed that overall buffer packet loss decreases very slowly with increasing buffer size, in sharp contrast to traditional queuing theory models where losses decrease exponentially fast with increasing buffer size. In the paper, our problem is to analytically study overflow and loss probabilities in a queue with self-similar packet traffic and get the asymptotic lower bounds to them.