arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.04277cs.NI
收藏

基于流中重复检测的服务节点近似发现

Approximate Discovery of Service Nodes by Duplicate Detection in Flows

Zhou Changling, Xiao Jianguo, Cui Jian, Zhang Bei, Li Feng

摘要:

关于哪些节点提供服务的知识对于网络管理员来说至关重要。服务节点的发现可以通过充分利用流中的重复元素检测来完成。由于网络流量巨大,特别是在大型ISP或校园网中,我们提出了一种基于循环Buddy Bloom Filters(RBBF)的近似算法,仅使用NetFlow数据进行服务检测。给出了RBBF数据结构的性质和分析。该方法具有较好的时空效率和较低的误报率.假阳性的部分。我们还展示了通过原型系统的贡献,通过现实世界的案例研究。

英文摘要:

Knowledge about which nodes provide services is of critical importance for network administrators. Discovery of service nodes can be done by making full use of duplicate element detection in flows. Because the amount of traffic across network is massive, especially in large ISPs or campus networks, we propose an approximate algorithm with Round-robin Buddy Bloom Filters(RBBF) for service detection using NetFlow data solely. The properties and analysis of RBBF data structure are also given. Our method has better time/space efficiency than conventional algorithm with a small false positive rate.%portion of false positive. We also demonstrate the contributions through a prototype system by real world case studies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑