Verification of the Self-Similarity of Campus Network Traffic
Jidong Wang
Abstract
Jidong Wang
Abstract
The self-similarity degree of network traffic is checked by computing the Hurst parameter based on the self-similar theory. In this paper, we capture packets on the campus network's backbone, and then compute the Hurst parameter to check the self-similar degree of network traffic by using the R/S method and the variance-time method. The existence of self-similarity is verified by experiments. We also discuss the network traffic abnormal detection based on the Hurst parameter's obvious changes.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The self-similarity degree of network traffic is checked by computing the Hurst parameter based on the self-similar theory. In this paper, we capture packets on the campus network's backbone, and then compute the Hurst parameter to check the self-similar degree of network traffic by using the R/S method and the variance-time method. The existence of self-similarity is verified by experiments. We also discuss the network traffic abnormal detection based on the Hurst parameter's obvious changes.
Key concepts: Self-similarity, Hurst exponent, Computer science, Similarity (geometry), Network packet, Variance (accounting), Campus network, Traffic generation model