Real‐time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components

In this article, we present the first algorithm in the streaming model to characterize completely the biconnectivity properties of undirected networks: articulation points, bridges, and connected and biconnected components. The motivation of our work was the development of a real-time algorithm to monitor the connectivity of the autonomous systems (AS) network, but the solution provided is general enough to be applied to any network. The network structure is represented by a graph, and the algorithm is analyzed in the datastream framework. Here, as in the on-line model, the input graph is revealed one item (i.e., graph edge) after the other, in an on-line fashion; but, if compared to traditional on-line computation, there are stricter requirements for both memory occupation and per item processing time. Our algorithm works by properly updating a forest over the graph nodes. All the graph (bi)connectivity properties are stored in this forest. We prove the correctness of the algorithm, together with its space (O(nlog n), with n being the number of nodes in the graph) and time bounds. We also present the results of a brief experimental evaluation against real-world graphs, including many samples of the AS network, ranging from medium to massive size. These preliminary experimental results confirm the effectiveness of our approach. © 2012 Wiley Periodicals, Inc. NETWORKS, Vol. 2012 © 2012 Wiley Periodicals, Inc.

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

[2]  Andrew McGregor,et al.  Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.

[3]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

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

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

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

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

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

[9]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

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

[11]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[12]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

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

[14]  Robert E. Tarjan,et al.  Maintaining bridge-connected and biconnected components on-line , 1992, Algorithmica.

[15]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

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

[17]  Celso C. Ribeiro,et al.  A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing , 2005, Networks.

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

[19]  Lixin Gao.  On inferring autonomous system relationships in the internet , 2001, TNET.

[20]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[21]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[22]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[23]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

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