Efficient Information Dissemination in Dynamic Networks

Dynamic network is the abstraction of networks with frequent topology changes arising from node mobility or other reasons. With the model of dynamic network, distributed computation problems can be formally studied with rigorous correctness. Information dissemination is one of such problems and it has received much attention recently. However, existing works focus on the time cost of dissemination, i.e. how fast the information can be disseminated to all nodes, and communication cost has been largely ignored. Our work focuses on high communication efficiency in information dissemination with correctness property guaranteed. We achieve this by making use of cluster-based hierarchy. Clustering has been widely studied and used in wireless networks to reduce communication cost. However, to the best of our knowledge, it has never been considered in the study of dynamic networks. In this paper, we firstly propose a dynamic network model, named (T, L)-HiNet, to extend existing dynamic network model with clusters. (T, L)-HiNet includes several properties defining the dynamics of cluster hierarchy in a dynamic network. Base on (T, L)-HiNet, we design hierarchical information dissemination algorithms for different scenarios of dynamics. The correctness of our algorithms is proved and the performance is analyzed. Compared with the algorithm recently proposed by Kuhn, Lynch and Oshman [7], our design can significantly reduce communication and our objective is fully achieved.

[1]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[2]  Torsten Hoefler,et al.  Kernel-Based Offload of Collective Operations - Implementation, Evaluation and Lessons Learned , 2011, Euro-Par.

[3]  Devavrat Shah,et al.  Computing separable functions via gossip , 2005, PODC '06.

[4]  Fabian Kuhn,et al.  Dynamic networks: models and algorithms , 2011, SIGA.

[5]  Torsten Hoefler,et al.  Group Operation Assembly Language - A Flexible Way to Express Collective Communication , 2009, 2009 International Conference on Parallel Processing.

[6]  Sayantan Sur,et al.  Optimizing MPI One Sided Communication on Multi-core InfiniBand Clusters Using Shared Memory Backed Windows , 2011, EuroMPI.

[7]  Terry Jones,et al.  Impacts of Operating Systems on the Scalability of Parallel Applications , 2003 .

[8]  Torsten Hoefler,et al.  A Case for Non-blocking Collective Operations , 2006, ISPA Workshops.

[9]  F. Petrini,et al.  The Case of the Missing Supercomputer Performance: Achieving Optimal Performance on the 8,192 Processors of ASCI Q , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[10]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[11]  Torsten Hoefler,et al.  Characterizing the Influence of System Noise on Large-Scale Applications by Simulation , 2010, 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis.

[12]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[13]  Jie Wu,et al.  Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication , 2006, IEEE Transactions on Parallel and Distributed Systems.

[14]  Darren J. Kerbyson,et al.  Efficient offloading of collective communications in large-scale systems , 2007, 2007 IEEE International Conference on Cluster Computing.

[15]  Arthur L. Liestman,et al.  Maintaining weakly-connected dominating sets for clustering ad hoc networks , 2005, Ad Hoc Networks.

[16]  Juraj Hromkovič,et al.  Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping) , 1996 .

[17]  Amit Kumar,et al.  Connectivity and inference problems for temporal networks , 2000, Symposium on the Theory of Computing.

[18]  Torsten Hoefler,et al.  Message progression in parallel computing - to thread or not to thread? , 2008, 2008 IEEE International Conference on Cluster Computing.

[19]  Andrea E. F. Clementi,et al.  Flooding time in edge-Markovian dynamic graphs , 2008, PODC '08.

[20]  Weijia Jia,et al.  Clustering wireless ad hoc networks with weakly connected dominating set , 2007, J. Parallel Distributed Comput..

[21]  Forum Mpi MPI: A Message-Passing Interface , 1994 .

[22]  David R. Karger,et al.  Faster information dissemination in dynamic networks via network coding , 2011, PODC '11.

[23]  B. Pittel On spreading a rumor , 1987 .

[24]  Dhabaleswar K. Panda,et al.  Designing Non-blocking Allreduce with Collective Offload on InfiniBand Clusters: A Case Study with Conjugate Gradient Solvers , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium.

[25]  Yutaka Ishikawa,et al.  Design of Kernel-Level Asynchronous Collective Communication , 2010, EuroMPI.

[26]  Anne-Marie Kermarrec,et al.  The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations , 2004, Middleware.

[27]  Brian D. O. Anderson,et al.  On the Properties of One-Dimensional Infrastructure-Based Wireless Multi-Hop Networks , 2012, IEEE Transactions on Wireless Communications.

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

[29]  Roy Friedman,et al.  Deterministic Dominating Set Construction in Networks with Bounded Degree , 2011, ICDCN.

[30]  Donald M. Topkis,et al.  Concurrent Broadcast for Information Dissemination , 1985, IEEE Transactions on Software Engineering.

[31]  Xin Yuan,et al.  Efficient MPI Bcast across different process arrival patterns , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[32]  Amith R. Mamidala,et al.  Looking under the hood of the IBM Blue Gene/Q network , 2012, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis.

[33]  Roger Wattenhofer,et al.  Information dissemination in highly dynamic graphs , 2005, DIALM-POMC '05.

[34]  Chen Avin,et al.  How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) , 2008, ICALP.

[35]  J. C. Vassilicos,et al.  A numerical strategy to combine high-order schemes, complex geometry and parallel computing for high resolution DNS of fractal generated turbulence , 2010 .

[36]  QI Ying-ying Nodes Neighborhood Relation-based Construction Algorithm for Minimum Connected Domination Set , 2010 .

[37]  Nancy A. Lynch,et al.  Distributed computation in dynamic networks , 2010, STOC '10.

[38]  Eli Upfal,et al.  Tight bounds on information dissemination in sparse mobile networks , 2011, PODC '11.

[39]  Torsten Hoefler,et al.  Optimization principles for collective neighborhood communications , 2012, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis.

[40]  Pierre Fraigniaud,et al.  Parsimonious flooding in dynamic graphs , 2009, PODC '09.

[41]  Sayantan Sur,et al.  High-performance and scalable non-blocking all-to-all with collective offload on InfiniBand clusters: a study with parallel 3D FFT , 2011, Computer Science - Research and Development.

[42]  Peter Grindrod,et al.  Evolving graphs: dynamical models, inverse problems and propagation , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.