We extend previous work on bursty network traffic characterization and management using heavy tailed self-similar processes. We revisit the proposed model for heavy network traffic, which is based on the linear fractional stable noise process to present a new algorithmic procedure for the estimation of the parameters of the model. Furthermore, we derive an asymptotic lower bound and an upper bound of the overflow probability of an ATM switch buffer
Published in:
Global Telecommunications Conference, 1998. GLOBECOM 1998. The Bridge to Global Integration. IEEE
(Volume:5
)
Date of Conference: 1998