Tracking per-flow state — Binned Duration Flow Tracking

B. Whitehead, Chung-Horng Lung, P. Rabinovitch
{"title":"Tracking per-flow state — Binned Duration Flow Tracking","authors":"B. Whitehead, Chung-Horng Lung, P. Rabinovitch","doi":"10.4304/jnw.7.1.37-51","DOIUrl":null,"url":null,"abstract":"Recent advances in network monitoring have increasingly focused on obtaining per-flow information, such as flow state. Tracking the state of network flows opens up a new dimension of information gathering for network operators, allowing previously unattainable data to be captured. This paper presents a time efficient novel method — Binned Duration Flow Tracking (BDFT) — of tracking per-flow state by grouping valid flows into “bins”. BDFT is intended for high-speed routers where CPU time is crucial. BDFT is time efficient by adopting Bloom filters as the primary data structures. Simulation results show that BDFT can achieve over 99% accuracy on traces of real network traffic.","PeriodicalId":426447,"journal":{"name":"Proceedings of the 2010 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS '10)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2010 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS '10)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4304/jnw.7.1.37-51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

Recent advances in network monitoring have increasingly focused on obtaining per-flow information, such as flow state. Tracking the state of network flows opens up a new dimension of information gathering for network operators, allowing previously unattainable data to be captured. This paper presents a time efficient novel method — Binned Duration Flow Tracking (BDFT) — of tracking per-flow state by grouping valid flows into “bins”. BDFT is intended for high-speed routers where CPU time is crucial. BDFT is time efficient by adopting Bloom filters as the primary data structures. Simulation results show that BDFT can achieve over 99% accuracy on traces of real network traffic.
跟踪每流状态-分级持续流跟踪
网络监控的最新进展越来越多地集中在获取每个流的信息,如流状态。跟踪网络流的状态为网络运营商开辟了一个新的信息收集维度,允许捕获以前无法获得的数据。本文提出了一种时间效率高的新方法——分桶持续流跟踪(BDFT),该方法通过将有效流分组到“箱”中来跟踪每个流的状态。BDFT适用于CPU时间非常重要的高速路由器。BDFT采用Bloom过滤器作为主要数据结构,节省了时间。仿真结果表明,BDFT对真实网络流量的跟踪准确率达到99%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信