A novel description of multifractal phenomenon of network traffic based on generalized cauchy process

Citation

Li, Ming and Lim, S. C. and Feng, Huamin (2007) A novel description of multifractal phenomenon of network traffic based on generalized cauchy process. In: Computational Science – ICCS 2007. Lecture Notes in Computer Science (4489). Springer Berlin Heidelberg, pp. 1-9. ISBN 978-3-540-72587-9

[img] Text
30.pdf
Restricted to Repository staff only

Download (210kB)

Abstract

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.

Item Type: Book Section
Additional Information: Book Subtitle: 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III
Subjects: Q Science > Q Science (General)
Divisions: Faculty of Engineering (FOE)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 04 Feb 2014 04:19
Last Modified: 04 Feb 2014 04:19
URII: http://shdl.mmu.edu.my/id/eprint/5061

Downloads

Downloads per month over past year

View ItemEdit (login required)