Fast optimization method : the window size and hurst parameter estimator on self-similar network traffic
This paper describes a version of the fast optimization method (FOM) used to estimate the Hurst parameter (H) with appropriate window sizes in self-similar network traffic. Large or short window sizes, for example, may cause the results to become unreliable. Estimating window sizes requires that th...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | 論文 |
| 出版事項: |
Taru Publications, New Delhi
2007
|
| 主題: | |
| オンライン･アクセス: | http://eprints.utm.my/id/eprint/5032/ http://dx.doi.org/10.1080/02522667.2007.10699750 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | This paper describes a version of the fast optimization method (FOM) used to estimate the Hurst parameter (H) with appropriate window sizes in self-similar network traffic. Large or short window sizes, for example, may cause the results to become unreliable. Estimating window sizes requires that the estimation process be repeated, such as in iterative optimization method (IOM) and will result in the high consumption of CPU time. This paper empirically compares the CPU time and the estimation results using both the FOM and IOM methods. Finally, it shows that the FOM outperforms the IOM in that it significantly reduces total CPU time and maintains the reliability of the estimation results. |
|---|