Distributed computing on core-periphery networks: Axiom-based design

Inspired by social networks and complex systems, we propose a core-periphery network architecture that supports fast computation for many distributed algorithms and is robust and efficient in number of links. Rather than providing a concrete network model, we take an axiom-based design approach. We provide three intuitive (and independent) algorithmic axioms and prove that any network that satisfies all axioms enjoys an efficient algorithm for a range of tasks (e.g., MST, sparse matrix multiplication, etc.). We also show the minimality of our axiom set: for networks that satisfy any subset of the axioms, the same efficiency cannot be guaranteed for any deterministic algorithm.

[1]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[2]  Kyomin Jung,et al.  Distributed ranking in networks with limited memory and communication , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[3]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[4]  Christoph Lenzen,et al.  Tight bounds for parallel randomized load balancing , 2011, Distributed Computing.

[5]  F. Lillo,et al.  Topology of correlation-based minimal spanning trees in real and model markets. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Lada A. Adamic.  The Small World Web , 1999, ECDL.

[7]  Michael Elkin.  An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem , 2006, SIAM J. Comput..

[8]  Henning Schulzrinne,et al.  An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol , 2004, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[10]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[11]  James Christopher Wyllie,et al.  The Complexity of Parallel Computations , 1979 .

[12]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[13]  Andrew Berns,et al.  Super-Fast Distributed Algorithms for Metric Facility Location , 2012, ICALP.

[14]  David Peleg,et al.  A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction , 2000, SIAM J. Comput..

[15]  Christoph Lenzen,et al.  "Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract) , 2012, DISC.

[16]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[17]  P. Holme.  Core-periphery organization of complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Chaomei Chen,et al.  Visualizing evolving networks: minimum spanning trees versus pathfinder networks , 2003, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714).

[19]  Daniel A. Hojman,et al.  Core and periphery in networks , 2008, J. Econ. Theory.

[20]  Martin G. Everett,et al.  Models of core/periphery structures , 2000, Soc. Networks.

[21]  Boaz Patt-Shamir,et al.  The Round Complexity of Distributed Sorting , 2011 .

[22]  Boaz Patt-Shamir,et al.  Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds , 2005, SIAM J. Comput..

[23]  Boaz Patt-Shamir,et al.  Distributed MST for constant diameter graphs , 2001, PODC '01.

[24]  Christoph Lenzen,et al.  Optimal deterministic routing and sorting on the congested clique , 2012, PODC '13.

[25]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[26]  F. Chung,et al.  Complex Graphs and Networks , 2006 .

[27]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[28]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[29]  Karolina Soltys,et al.  The Hardness of Median in the Synchronized Bit Communication Model , 2011, TAMC.

[30]  A. Venables,et al.  The Spatial Economy: Cities, Regions, and International Trade , 2000 .

[31]  Shay Kutten,et al.  Fast Distributed Construction of Small k-Dominating Sets and Applications , 1998, J. Algorithms.

[32]  Alan MacCormack,et al.  The Architecture of Complex Systems: Do Core-Periphery Structures Dominate? , 2010 .

[33]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[34]  Jaroslav Nesetril,et al.  Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history , 2001, Discret. Math..

[35]  Rakesh Kumar,et al.  The FastTrack overlay: A measurement study , 2006, Comput. Networks.