Real-Time Diameter Monitoring for Time-Evolving Graphs

The goal of this work is to identify the diameter, the maximum distance between any two nodes, of graphs that evolve over time. This problem is useful for many applications such as improving the quality of P2P networks. Our solution, G-Scale, can track the diameter of time-evolving graphs in the most efficient and correct manner. G-Scale is based on two ideas: (1) It estimates the maximal distances at any time to filter unlikely nodes that cannot be associated with the diameter, and (2) It maintains answer node pairs by exploiting the distances from a newly added node to other nodes. Our theoretical analyses show that G-Scale guarantees exactness in identifying the diameter. We perform several experiments on real and large datasets. The results show that G-Scale can detect the diameter significantly faster than existing approaches.

[1]  Aristides Gionis,et al.  Fast shortest path distance estimation in large networks , 2009, CIKM.

[2]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[3]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[4]  Damien Magoni,et al.  Analysis of the autonomous system network topology , 2001, CCRV.

[5]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations , 2010 .

[7]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[8]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[9]  Janet Efstathiou,et al.  Structural robustness of complex network , 2006 .

[10]  Abhishek Kumar,et al.  Ulysses: a robust, low-diameter, low-latency peer-to-peer network , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[11]  Hector Garcia-Molina,et al.  Peer-to-peer research at Stanford , 2003, SGMD.

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[13]  Scott Shenker,et al.  Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.

[14]  Peter Druschel,et al.  Peer-to-peer systems , 2010, Commun. ACM.

[15]  Hema Swetha Koppula,et al.  Study and Improvement of Robustness of Overlay Networks , 2008 .

[16]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[17]  David D. Jensen,et al.  Using structure indices for efficient approximation of network properties , 2006, KDD '06.

[18]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[19]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .