Inferring the periodicity in large-scale Internet measurements

Oded Argon, Y. Shavitt, Udi Weinsberg
{"title":"Inferring the periodicity in large-scale Internet measurements","authors":"Oded Argon, Y. Shavitt, Udi Weinsberg","doi":"10.1109/INFCOM.2013.6566964","DOIUrl":null,"url":null,"abstract":"Many Internet events exhibit periodical patterns. Such events include the availability of end-hosts, usage of internetwork links for balancing load and cost of transit, traffic shaping during peak hours, etc. Internet monitoring systems that collect huge amount of data can leverage periodicity information for improving resource utilization. However, automatic periodicity inference is a non trivial task, especially when facing measurement “noise”. In this paper we present two methods for assessing the periodicity of network events and inferring their periodical patterns. The first method uses Power Spectral Density for inferring a single dominant period that exists in a signal representing the sampling process. This method is highly robust to noise, but is most useful for single-period processes. Thus, we present a novel method for detecting multiple periods that comprise a single process, using iterative relaxation of the time-domain autocorrelation function. We evaluate these methods using extensive simulations, and show their applicability on real Internet measurements of end-host availability and IP address alternations.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Proceedings IEEE INFOCOM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.2013.6566964","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Many Internet events exhibit periodical patterns. Such events include the availability of end-hosts, usage of internetwork links for balancing load and cost of transit, traffic shaping during peak hours, etc. Internet monitoring systems that collect huge amount of data can leverage periodicity information for improving resource utilization. However, automatic periodicity inference is a non trivial task, especially when facing measurement “noise”. In this paper we present two methods for assessing the periodicity of network events and inferring their periodical patterns. The first method uses Power Spectral Density for inferring a single dominant period that exists in a signal representing the sampling process. This method is highly robust to noise, but is most useful for single-period processes. Thus, we present a novel method for detecting multiple periods that comprise a single process, using iterative relaxation of the time-domain autocorrelation function. We evaluate these methods using extensive simulations, and show their applicability on real Internet measurements of end-host availability and IP address alternations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
推断大规模互联网测量的周期性
许多互联网事件表现出周期性的模式。这些事件包括终端主机的可用性、用于平衡负载和传输成本的互连链路的使用、高峰时段的流量塑造等。互联网监测系统收集了大量的数据,可以利用周期性信息来提高资源利用率。然而,自动周期推断是一项艰巨的任务,特别是在面对测量“噪声”时。本文提出了两种评估网络事件周期性和推断其周期模式的方法。第一种方法使用功率谱密度来推断存在于代表采样过程的信号中的单个主导周期。该方法对噪声具有很强的鲁棒性,但对单周期过程最有用。因此,我们提出了一种新的方法来检测包含单个过程的多个周期,使用时域自相关函数的迭代松弛。我们使用广泛的模拟来评估这些方法,并展示了它们在终端主机可用性和IP地址变更的真实互联网测量中的适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
VoteTrust: Leveraging friend invitation graph to defend against social network Sybils Groupon in the Air: A three-stage auction framework for Spectrum Group-buying Into the Moana1 — Hypergraph-based network layer indirection Prometheus: Privacy-aware data retrieval on hybrid cloud Adaptive device-free passive localization coping with dynamic target speed
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1