Translator Disclaimer
18 August 1999 Buffer overflow under self-similar packet traffic
Author Affiliations +
Abstract
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.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Boris Tsybakov and Nicolas D. Georganas "Buffer overflow under self-similar packet traffic", Proc. SPIE 3841, Performance and Control of Network Systems III, (18 August 1999); https://doi.org/10.1117/12.360369
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top