High Speed Elephant Flow Detection Under Partial Information

2018 INTERNATIONAL SYMPOSIUM ON NETWORKS, COMPUTERS AND COMMUNICATIONS (ISNCC 2018)(2018)

引用 5|浏览15
暂无评分
摘要
In this paper we introduce a new framework to detect elephant flows at very high speed rates and under uncertainty. The framework provides exact mathematical formulas to compute the detection likelihood and introduces a new flow reconstruction lemma under partial information. These theoretical results lead to the design of BubbleCache, a new elephant flow detection algorithm designed to operate near the optimal tradeoff between computational scalability and accuracy by dynamically tracking the traffic's natural cutoff sampling rate. We demonstrate on a real world 100 Gbps network that the BubbleCache algorithm helps reduce the computational cost by a factor of 1000 and the memory requirements by a factor of 100 while detecting the top flows on the network with very high probability.
更多
查看译文
关键词
partial information,high speed rates,exact mathematical formulas,detection likelihood,flow reconstruction lemma,computational scalability,BubbleCache algorithm,computational cost,high speed elephant flow detection algorithm,traffic natural cutoff sampling rate,bit rate 100 Gbit/s
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要