Modeling network traffic using generalized Cauchy process

Processes with long-range dependence (LRD) have gained wide applications in many fields of science and technologies ranging from hydrology to network traffic. Two key properties of such processes are LRD that is characterized by the Hurst parameter H and self-similarity (SS) that is measured by the fractal dimension D. However, in the popular traffic model using fractional Gaussian noise (fGn), these two parameters are linearly related. This may be regarded as a limitation of fGn in traffic modeling from the point of view of either accurately fitting real traffic or appropriately explaining the particular multi-fractal phenomena of traffic. In this paper, we discuss recent results in traffic modeling from a view of the generalized Cauchy (GC) process. The GC process is indexed by two parameters D and H. The parameter D in the GC model is independent of H. Hence, it provides a more flexible way to describe the multi-fractal phenomena of traffic in addition to accurately modeling traffic for both short-term lags and long-term ones.