跟踪网络流量中的长时间流

Aiyou Chen, Yu Jin, Jin Cao
{"title":"跟踪网络流量中的长时间流","authors":"Aiyou Chen, Yu Jin, Jin Cao","doi":"10.1109/INFCOM.2010.5462244","DOIUrl":null,"url":null,"abstract":"We propose the tracking of long duration flows as a new network measurement primitive. Long-duration flows are characterized by their long lived nature in time, and may not have high traffic volumes. We propose an efficient data streaming algorithm to effectively track long duration flows. Our basic technique is to maintain only two Bloom filters at any given time. In each time duration, only old flows that appear in the current time duration get copied to the current Bloom filter. Our basic algorithm is further enhanced by sampling. Using real network traces, we show that our tracking algorithm is very accurate with low false positive and false negative probabilities. Using multi-faceted analysis, we show that more than 50\\% of hosts participating in long duration flows (duration no less than 30 minutes) are blacklisted by various public sources.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"47","resultStr":"{\"title\":\"Tracking Long Duration Flows in Network Traffic\",\"authors\":\"Aiyou Chen, Yu Jin, Jin Cao\",\"doi\":\"10.1109/INFCOM.2010.5462244\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose the tracking of long duration flows as a new network measurement primitive. Long-duration flows are characterized by their long lived nature in time, and may not have high traffic volumes. We propose an efficient data streaming algorithm to effectively track long duration flows. Our basic technique is to maintain only two Bloom filters at any given time. In each time duration, only old flows that appear in the current time duration get copied to the current Bloom filter. Our basic algorithm is further enhanced by sampling. Using real network traces, we show that our tracking algorithm is very accurate with low false positive and false negative probabilities. Using multi-faceted analysis, we show that more than 50\\\\% of hosts participating in long duration flows (duration no less than 30 minutes) are blacklisted by various public sources.\",\"PeriodicalId\":259639,\"journal\":{\"name\":\"2010 Proceedings IEEE INFOCOM\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"47\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Proceedings IEEE INFOCOM\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.2010.5462244\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Proceedings IEEE INFOCOM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.2010.5462244","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 47

摘要

我们提出了长时间流跟踪作为一种新的网络测量原语。长时间流的特点是它们在时间上的寿命长,可能不会有很高的流量。我们提出了一种高效的数据流算法来有效地跟踪长时间流。我们的基本技术是在任何给定时间只维护两个Bloom过滤器。在每个持续时间中,只有出现在当前持续时间中的旧流才会被复制到当前Bloom过滤器中。我们的基本算法通过采样进一步增强。通过实际的网络跟踪,我们证明了我们的跟踪算法是非常准确的,具有低的假阳性和假负概率。通过多方面的分析,我们发现超过50%的参与长时间流量(持续时间不少于30分钟)的主机被各种公共来源列入黑名单。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Tracking Long Duration Flows in Network Traffic
We propose the tracking of long duration flows as a new network measurement primitive. Long-duration flows are characterized by their long lived nature in time, and may not have high traffic volumes. We propose an efficient data streaming algorithm to effectively track long duration flows. Our basic technique is to maintain only two Bloom filters at any given time. In each time duration, only old flows that appear in the current time duration get copied to the current Bloom filter. Our basic algorithm is further enhanced by sampling. Using real network traces, we show that our tracking algorithm is very accurate with low false positive and false negative probabilities. Using multi-faceted analysis, we show that more than 50\% of hosts participating in long duration flows (duration no less than 30 minutes) are blacklisted by various public sources.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks Overcoming Failures: Fault-tolerance and Logical Centralization in Clean-Slate Network Management Improving QoS in BitTorrent-like VoD Systems Lightweight Mutual Authentication and Ownership Transfer for RFID Systems Overhearing-aware Joint Routing and Rate Selection in Multi-hop Multi-rate UWB-based WPANs
×
引用
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