检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]电子信息控制重点实验室,四川成都610036 [2]电子科技大学通信抗干扰技术国家级重点实验室,四川成都611731
出 处:《通信学报》2013年第3期23-31,共9页Journal on Communications
基 金:国家自然科学基金资助项目(61271168;61001085);国家科技重大专项基金资助项目(2010ZX03005-002);国家重点基础研究发展计划("973"计划)基金资助项目(2009CB320405);The National Natural Science Foundation of China(61271168;61001085)~~
摘 要:针对网络流量的波动性与自相似特性为其精确预测提出的挑战,提出了一种基于FARIMA-GARCH模型的预测算法。该算法首先利用分段双向CUSUM检测算法对流量序列的均值进行有效检测,并在此基础上将序列零均值化;然后采用限定搜索法对分数差分阶数进行精确估计;在获得模型参数后,使用FARIMA-GARCH模型对网络流量进行预测。仿真实验表明,限定搜索法能够获得比传统算法更高的估计精度。随后采用真实网络流量验证了预测算法的性能,在保持与FARIMA预测算法等价的时间复杂度下,其均方根和相对均方根误差与RBF神经网络预测算法相当,而高于FARIMA预测算法。同时,预测算法对突发流量的跟踪和预测性能明显优于对比算法,且有更好的区间估计性能。The volatility and self-similarity features of network traffic poses great challenge to network traffic prediction. For this purpose, a novel network traffic prediction scheme based on FARIMA-GARCH model was formulated. A novel method was used to get a zero-mean traffic series by a piecewise two-way CUSUM detection algorithm. Then the fraction difference order was evaluated with precision by the presented bounded search method. After obtaining the model parameters, the prediction algorithm was conducted by using FARIMA-GARCH model. Compared with the traditional method, the limited search method reduces the evaluated error despite a slight computational cost. Then simulation was carded out to verify the accuracy of proposed algorithm with real network traffic. The proposed prediction method keeps the same time complexity with the FARIMA model prediction method, and the simulation result shows that the root mean-square error and relative root mean-square error, which closely resemble the RBF prediction method, is less than FARIMA model prediction method. And the interval estimation and volatility prediction performance is excellent.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.138.101.1