A Novel Description of Multifractal Phenomenon of Network Traffic Based on Generalized Cauchy Process

Let D(n) and H(n) be the fractal dimension and the Hurst parameter of traffic in the nth interval, respectively. Thus, this paper gives the experimental variance analysis of D(n) and H(n) of network traffic based on the generalized Cauchy (GC) process on an interval-by-interval basis. We experimentally infer that traffic has the phenomenon Var[D(n)] > Var[H(n)]. This suggests a new way to describe the multifractal phenomenon of traffic. That is, traffic has local high-variability and global robustness. Verifications of that inequality are demonstrated with real traffic.