DocumentCode
1906656
Title
Identifying Long-range Dependent Network Traffic through Autocorrelation Functions
Author
Rezaul, Karim Mohammed ; Grout, Vic
Author_Institution
Univ. of Wales, Wrexham
fYear
2007
fDate
15-18 Oct. 2007
Firstpage
692
Lastpage
697
Abstract
For over a decade researchers have been reporting the impact of self-similar long-range dependent network traffic. Long-range dependence (LRD) is of great significance in traffic engineering problems such as measurement, queuing strategy, buffer sizing and admission and congestion control. In this research, in order to determine the existence of LRD, we apply three different robust versions of the autocorrelation function (ACF), namely weighted ACF (WACF), trimmed ACF (TACF) and variance-ratio of differences and sums, known as the D/S variance estimator (DACF), in conjunction with the sample ACF (which is moment based). Here we define the moment based ACF as MACF. In telecommunications, LRD traffic defines that a similar pattern of traffic persists for a longer span of time. Through ACF, it is possible to detect how long the traffic lasts. The aim of this research is to investigate the performance of ACF in identifying the existence of LRD traffic.
Keywords
Internet; correlation methods; telecommunication traffic; D/S variance estimator; admission control; buffer sizing; congestion control; long-range dependence network traffic; queuing strategy; trimmed autocorrelation function; weighted autocorrelation function; Autocorrelation; Capacity planning; Communication system traffic control; Computer networks; IP networks; Internet; Probability distribution; Robustness; Telecommunication traffic; Traffic control; ACF; Hurst parameter; LRD; Self-similarity;
fLanguage
English
Publisher
ieee
Conference_Titel
Local Computer Networks, 2007. LCN 2007. 32nd IEEE Conference on
Conference_Location
Dublin
ISSN
0742-1303
Print_ISBN
0-7695-3000-1
Electronic_ISBN
0742-1303
Type
conf
DOI
10.1109/LCN.2007.38
Filename
4367903
Link To Document