Network traffic clustering and geographic visualization

Ali Hushyar · 2009

Table of Contents 1 Introduction 1 2 Determining Dimensions of Network Traffic 4 3 Extracting Dimensions from Packet Traces 8 4 Clustering Algorithms 4.1 K-means and K-medoids 4.2 Affinity Propagation 4.3 Affinity Propagation Implementation 4.4 Clustering Network Flow Records Using Affinity Propagation 5 Information Visualization 5.1 Treemaps 5.2 The HistoMap Layout Algorithm 5.3 HNMap Implementation 5.3.1 HNMap Backing Data 5.3.2HistoMap Logic 5.3.3HNMap Screenshots 5.4 HNMap Projection Conclusion References v

Read the paper · More papers on PaperTik