IP骨干网流量矩阵的预测与校正

Wei Liu, Ao Hong, Liang Ou, Wenchao Ding, Ge Zhang
{"title":"IP骨干网流量矩阵的预测与校正","authors":"Wei Liu, Ao Hong, Liang Ou, Wenchao Ding, Ge Zhang","doi":"10.1109/PCCC.2014.7017051","DOIUrl":null,"url":null,"abstract":"The prediction of traffic matrices (TM) is critical for many IP network management tasks. With the recent development of high-speed traffic measurement technologies, complete TM could be collected from operational IP networks. In this paper, we report our efforts in predicting the TM measured from a real IP backbone network in China. The new problem here is how to deal with the rich but noisy TM data and predict various traffics, ranging from the original-destination (OD) flow traffic, the node traffic to the total network traffic. After examining the traffic characteristics, we choose the node traffic as the principal data for prediction, and propose three prediction and correction methods: Independent Node Prediction (INP), Total Matrix Prediction with Key Element Correction (TMP-KEC) and Principle Component Prediction with Fluctuation Component Correction (PCP-FCC). TMP-KEC and PCP-FCC are designed with different purposes, i.e., for smaller prediction errors of the total network and the OD flows, respectively. The results show that, INP performs worst; TMP-KEC efficiently reduces the prediction errors of the large matrix elements; while, PCP-FCC achieves smaller average prediction errors for the elements as well as the complete matrix.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"264 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Prediction and correction of traffic matrix in an IP backbone network\",\"authors\":\"Wei Liu, Ao Hong, Liang Ou, Wenchao Ding, Ge Zhang\",\"doi\":\"10.1109/PCCC.2014.7017051\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The prediction of traffic matrices (TM) is critical for many IP network management tasks. With the recent development of high-speed traffic measurement technologies, complete TM could be collected from operational IP networks. In this paper, we report our efforts in predicting the TM measured from a real IP backbone network in China. The new problem here is how to deal with the rich but noisy TM data and predict various traffics, ranging from the original-destination (OD) flow traffic, the node traffic to the total network traffic. After examining the traffic characteristics, we choose the node traffic as the principal data for prediction, and propose three prediction and correction methods: Independent Node Prediction (INP), Total Matrix Prediction with Key Element Correction (TMP-KEC) and Principle Component Prediction with Fluctuation Component Correction (PCP-FCC). TMP-KEC and PCP-FCC are designed with different purposes, i.e., for smaller prediction errors of the total network and the OD flows, respectively. The results show that, INP performs worst; TMP-KEC efficiently reduces the prediction errors of the large matrix elements; while, PCP-FCC achieves smaller average prediction errors for the elements as well as the complete matrix.\",\"PeriodicalId\":105442,\"journal\":{\"name\":\"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)\",\"volume\":\"264 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.2014.7017051\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.2014.7017051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

流量矩阵的预测是许多IP网络管理任务的关键。随着高速流量测量技术的发展,可以从可运行的IP网络中收集完整的TM。在本文中,我们报告了我们对中国真实IP骨干网测量的TM的预测工作。这里的新问题是如何处理丰富但有噪声的TM数据,并预测各种流量,从原始目的地流量、节点流量到网络总流量。在考察流量特征的基础上,选择节点流量作为预测的主数据,提出了独立节点预测(INP)、总矩阵预测结合关键元校正(TMP-KEC)和主成分预测结合波动分量校正(PCP-FCC)三种预测与校正方法。TMP-KEC和PCP-FCC的设计目的不同,即对总网和OD流量的预测误差分别较小。结果表明,INP算法性能最差;TMP-KEC有效地降低了大矩阵元素的预测误差;而PCP-FCC对元素和完整矩阵的平均预测误差较小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Prediction and correction of traffic matrix in an IP backbone network
The prediction of traffic matrices (TM) is critical for many IP network management tasks. With the recent development of high-speed traffic measurement technologies, complete TM could be collected from operational IP networks. In this paper, we report our efforts in predicting the TM measured from a real IP backbone network in China. The new problem here is how to deal with the rich but noisy TM data and predict various traffics, ranging from the original-destination (OD) flow traffic, the node traffic to the total network traffic. After examining the traffic characteristics, we choose the node traffic as the principal data for prediction, and propose three prediction and correction methods: Independent Node Prediction (INP), Total Matrix Prediction with Key Element Correction (TMP-KEC) and Principle Component Prediction with Fluctuation Component Correction (PCP-FCC). TMP-KEC and PCP-FCC are designed with different purposes, i.e., for smaller prediction errors of the total network and the OD flows, respectively. The results show that, INP performs worst; TMP-KEC efficiently reduces the prediction errors of the large matrix elements; while, PCP-FCC achieves smaller average prediction errors for the elements as well as the complete matrix.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信