A Novel Graph Spectra Approach to Anomaly Detection in Border Gateway Protocol
摘要
We carry out an effective clustering of distributed time series graphs. The work uses singular value decomposition (SVD) of spectral gaps of graphs derived from BGP data found at the RouteViews Project at the University of Oregon. We detect extremal events and examine anomalous events that cause disruptions in Internet routing. We use spectral gaps to examine how redundant and sparse the graph is. We base the anomaly detection method in BGP networks on the fact that a drop in the value would signify a lack of this redundancy, which in the distributed redundant Internet would be an anomalous event.