Real-time analysis of critical nodes in network cores

The articulation points and bridges of a connected network are, respectively, the vertices and the edges whose removal disconnects the network. However, not all the articulation points (resp. bridges) are equal: from the graph theoretic perspective, there is no difference whether the removal of a vertex (resp. bridge) disconnects only one vertex from the rest of the network, or it cuts the network in two pieces. But in the monitoring of a huge network, it makes a difference. We present a real-time algorithm, analyzed in the (semi-)streaming model of computation, that is able to identify a core subset of the articulation points (resp. bridges), i.e. the ones whose removal has a big impact on the network: these are the critical nodes (resp. edges) of the network. We complement our work with an experimental evaluation of the algorithm against ten years of samples of the Autonomous System network, that confirms the effectiveness of our approach.

[1]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[2]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[3]  Andrew McGregor.  Finding Matchings in the Streaming Model , 2004 .

[4]  Vladimir Batagelj,et al.  Generalized Cores , 2002, ArXiv.

[5]  Maurizio Patrignani,et al.  Dynamic Analysis of the Autonomous System Graph , 2004 .

[6]  Joan Feigenbaum,et al.  Graph distances in the streaming model: the value of space , 2005, SODA '05.

[7]  J. Ian Munro,et al.  Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[8]  Giorgio Ausiello,et al.  Real-time anomalies detection and analysis of network structure, with application to the Autonomous System network , 2011, 2011 7th International Wireless Communications and Mobile Computing Conference.

[9]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[10]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[11]  Giuseppe F. Italiano,et al.  Graph Spanners in the Streaming Model: An Experimental Study , 2009, Algorithmica.

[12]  Giorgio Ausiello,et al.  Real‐time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components , 2012, Networks.

[13]  Michael Elkin,et al.  Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners , 2007, TALG.

[14]  Ziv Bar-Yossef,et al.  Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.

[15]  Jeffery R. Westbrook,et al.  A Functional Approach to External Graph Algorithms , 1998, ESA.

[16]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[17]  Thomas Erlebach,et al.  Assigning AS relationships to satisfy the Gao-Rexford conditions , 2010, The 18th IEEE International Conference on Network Protocols.

[18]  G. Di Battista,et al.  Computing the types of the relationships between autonomous systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Giuseppe Di Battista,et al.  Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation , 2004 .

[20]  Joan Feigenbaum,et al.  On graph problems in a semi-streaming model , 2005, Theor. Comput. Sci..

[21]  Tony Bates,et al.  Guidelines for creation, selection, and registration of an Autonomous System (AS) , 1996, RFC.

[22]  Prabhakar Raghavan,et al.  Computing on data streams , 1999, External Memory Algorithms.