Citation
Li, Ming and Lim, S. C. and Hu, Bai-Jiong and Feng, Huamin (2007) Towards describing multi-fractality of traffic using local hurst function. In: Computational Science – ICCS 2007. Lecture Notes in Computer Science (4488). Springer Berlin Heidelberg, pp. 1012-1020. ISBN 978-3-540-72585-5
Text
32.pdf Restricted to Repository staff only Download (211kB) |
Abstract
Long-range dependence and self-similarity are two basic properties of network traffic time series. Fractional Brownian motion (fBm) and its increment process fractional Gaussian noise (fGn) are commonly used to model network traffic with the Hurst index H that determines both the regularity of the sample paths and the long memory property of traffic. However, it appears too restrictive for traffic modeling since it can only model sample paths with the same smoothness for all time parameterized by a constant H. A natural extension of fBm is multifractional Brownian motion (mBm), which is indexed by a time-dependent Hurst index H(t). The main objective of this paper is to model multi-fractality of traffic using H(t), i.e., mBm, on a point-by-point basis instead of an interval-by-interval basis as traditionally done in computer networks. The numerical results for H(t) of real traffic, which are demonstrated in this paper, show that H(t) of traffic is time-dependent, which not only provide an alternative evidence of the multifractal phenomena of traffic but also reveal an challenging issue in traffic modeling: multi-fractality modeling of traffic.
Item Type: | Book Section |
---|---|
Additional Information: | Book Subtitle: 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part II |
Subjects: | T Technology > TA Engineering (General). Civil engineering (General) |
Divisions: | Faculty of Engineering (FOE) |
Depositing User: | Ms Rosnani Abd Wahab |
Date Deposited: | 04 Feb 2014 05:09 |
Last Modified: | 04 Feb 2014 05:09 |
URII: | http://shdl.mmu.edu.my/id/eprint/5066 |
Downloads
Downloads per month over past year
Edit (login required) |