.png){kind=icon}
返回
Visualizing big network traffic data using frequent pattern mining and hypergraphs
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-013-0282-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Visualizing communication logs, like NetFlow records, is extremely useful for numerous tasks that need to analyze network traffic traces, like network planning, performance monitoring, and troubleshooting. Communication logs, however, can be massive, which necessitates designing effective visualization techniques for large data sets. To address this problem, we introduce a novel network traffic visualization scheme based on the key ideas of (1) exploiting frequent itemset mining (FIM) to visualize a succinct set of interesting traffic patterns extracted from large traces of communication logs; and (2) visualizing extracted patterns as hypergraphs that clearly display multi-attribute associations. We demonstrate case studies that support the utility of our visualization scheme and show that it enables the visualization of substantially larger data sets than existing network traffic visualization schemes based on parallel-coordinate plots or graphs. For example, we show that our scheme can easily visualize the patterns of more than 41 million NetFlow records. Previous research has explored using parallel-coordinate plots for visualizing network traffic flows. However, such plots do not scale to data sets with thousands of even millions of flows.
Keyword:
Visualization
Big data
Network traffic
Frequent item-set mining
Network security
NetFlow
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
引用论文
Improved Synthesis of the π-Electron Donor Bis(ethylenethio)tetrathiafulvalene (BET-TTF).png)
Synthesis
SynthesisIF0
PREAI
分享收藏分享收藏分享收藏Quantum dots-based fluoroimmunoassay for the simultaneous detection of clothianidin and thiacloprid in environmental and agricultural samplesRSC Advances
RSC AdvancesIF0
PREAI
分享收藏
查看更多内容