Distributed Local Multi-Aggregation and Centrality Approximation

We study local aggregation and graph analysis in distributed environments using the message passing model. We provide a flexible framework, where each of the nodes in a set $S$--which is a subset of all nodes in the network--can perform a large range of common aggregation functions in its $k$-neighborhood. We study this problem in the CONGEST model, where in each synchronous round, every node can transmit a different (but short) message to each of its neighbors. While the $k$-neighborhoods of nodes in $S$ might overlap and aggregation could cause congestion in this model, we present an algorithm that needs time $O(|S|+k)$ even when each of the nodes in $S$ performs a different aggregation on its $k$-neighborhood. The framework is not restricted to aggregation-trees such that it can be used for more advanced graph analysis. We demonstrate this by providing efficient approximations of centrality measures and approximation of minimum routing cost trees.

[1]  Haixun Wang,et al.  Trinity: a distributed graph engine on a memory cloud , 2013, SIGMOD '13.

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

[3]  Dahlia Malkhi,et al.  Efficient distributed approximation algorithms via probabilistic tree embeddings , 2008, PODC '08.

[4]  M. A. Beauchamp.  AN IMPROVED INDEX OF CENTRALITY. , 1965, Behavioral science.

[5]  Christoph Lenzen,et al.  Efficient distributed source detection with limited bandwidth , 2013, PODC '13.

[6]  Charu C. Aggarwal,et al.  A Survey of Clustering Algorithms for Graph Data , 2010, Managing and Mining Graph Data.

[7]  Roger Wattenhofer,et al.  Distributed selection: a missing piece of data aggregation , 2008, CACM.

[8]  T. C. Hu.  Optimum Communication Spanning Trees , 1974, SIAM J. Comput..

[9]  Richard T. Wong,et al.  Worst-Case Analysis of Network Design Problem Heuristics , 1980, SIAM J. Algebraic Discret. Methods.

[10]  David Peleg,et al.  Distributed verification and hardness of distributed approximation , 2010, STOC '11.

[11]  David D. Jensen,et al.  Graph clustering with network structure indices , 2007, ICML '07.

[12]  Stephan Holzer.  Distance computation, information dissemination, and wireless capacity in networks , 2014 .

[13]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[14]  David Eppstein,et al.  Fast approximation of centrality , 2000, SODA '01.

[15]  Chuan Yi Tang,et al.  A polynomial time approximation scheme for minimum routing cost spanning trees , 1998, SODA '98.

[16]  Alex Bavelas,et al.  Communication Patterns in Task‐Oriented Groups , 1950 .

[17]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[18]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[19]  Pramod K. Varshney,et al.  Data-aggregation techniques in sensor networks: a survey , 2006, IEEE Communications Surveys & Tutorials.

[20]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[21]  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.

[22]  Jie Wu,et al.  A Survey on Intrusion Detection in Mobile Ad Hoc Networks , 2007 .

[23]  Roger Wattenhofer,et al.  Optimal distributed all pairs shortest paths and applications , 2012, PODC '12.

[24]  Roger Wattenhofer,et al.  Distributed Approximation of Minimum Routing Cost Trees , 2014, SIROCCO.

[25]  Michael F. Worboys,et al.  Detecting basic topological changes in sensor networks by local aggregation , 2008, GIS '08.

[26]  Jon Crowcroft,et al.  Lighthouses for Scalable Distributed Location , 2003, IPTPS.

[27]  Luciano Rossoni,et al.  Models and methods in social network analysis , 2006 .

[28]  David A. Bader,et al.  Approximating Betweenness Centrality , 2007, WAW.