Fanout Inference from Link Count

Cedric Fortuny, O. Brun, Jean-Marie Garcia
{"title":"Fanout Inference from Link Count","authors":"Cedric Fortuny, O. Brun, Jean-Marie Garcia","doi":"10.1109/ECUMN.2007.20","DOIUrl":null,"url":null,"abstract":"The traffic matrix is the fundamental input data in network planning, simulation and traffic engineering. However, it is often unknown and its direct measurement with devices such as Netflow is a too heavy process for large high-speed networks. The estimation of the traffic matrix from link counts appears as the best alternative approach. Recent works assume that prior information do not allow alone an accurate estimation of the traffic matrix so they are using Netflow measures to calibrate their model. These models assume spatial and temporal relations between different instants of measure. We show in this paper that we can obtain similar error rates without this costly calibration phase thanks to a spatial and temporal relation introduced in K. Papagiannaki et al. (2004)","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECUMN.2007.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The traffic matrix is the fundamental input data in network planning, simulation and traffic engineering. However, it is often unknown and its direct measurement with devices such as Netflow is a too heavy process for large high-speed networks. The estimation of the traffic matrix from link counts appears as the best alternative approach. Recent works assume that prior information do not allow alone an accurate estimation of the traffic matrix so they are using Netflow measures to calibrate their model. These models assume spatial and temporal relations between different instants of measure. We show in this paper that we can obtain similar error rates without this costly calibration phase thanks to a spatial and temporal relation introduced in K. Papagiannaki et al. (2004)
从链路计数推断Fanout
流量矩阵是网络规划、仿真和交通工程的基本输入数据。然而,它通常是未知的,并且使用诸如Netflow之类的设备对其进行直接测量对于大型高速网络来说是一个过于繁重的过程。根据链路数估计流量矩阵是最好的替代方法。最近的研究假设先验信息不允许单独对流量矩阵进行准确估计,因此他们使用Netflow测量来校准他们的模型。这些模型假定不同测量时刻之间的空间和时间关系。我们在本文中表明,由于K. Papagiannaki等人(2004)中引入的空间和时间关系,我们可以在没有这种昂贵的校准阶段的情况下获得类似的错误率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信