SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Regular Article: The Diameter of Sparse Random Graphs
Advances in Applied Mathematics
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Randomized Broadcast in Networks
SIGAL '90 Proceedings of the International Symposium on Algorithms
Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Controlled flooding search in a large network
IEEE/ACM Transactions on Networking (TON)
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Flooding time in edge-Markovian dynamic graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Information spreading in stationary Markovian evolving graphs
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Dynamic networks: models and algorithms
ACM SIGACT News
Coordinated consensus in dynamic networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Random walks, interacting particles, dynamic networks: randomness can be helpful
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Time-varying graphs and dynamic networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Viral processes by random walks on random regular graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Parsimonious flooding in geometric random-walks
DISC'11 Proceedings of the 25th international conference on Distributed computing
Flooding Time of Edge-Markovian Evolving Graphs
SIAM Journal on Discrete Mathematics
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Information spreading in dynamic graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the exploration of time-varying networks
Theoretical Computer Science
Fast distributed computation in dynamic networks via random walks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Lower bounds on information dissemination in dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
An efficient generator for clustered dynamic random networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Highly dynamic distributed computing with byzantine failures
Proceedings of the 2013 ACM symposium on Principles of distributed computing
On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks
Wireless Personal Communications: An International Journal
Expressivity of time-varying graphs
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Causality, influence, and computation in possibly disconnected synchronous dynamic networks
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
An edge-Markovian process with birth-rate p and death-rate q generates sequences of graphs (G0,G1,G2,…) with the same node set [n] such that Gt is obtained from Gt−1 as follows: if e ∉ E(Gt−1) then e ∈ E(Gt) with probability p, and if e ∈ E(Gt−1) then e ∉ E(Gt) with probability q. Clementi et al. (PODC 2008) analyzed thoroughly information dissemination in such dynamic graphs, by establishing bounds on their flooding time--flooding is the basic mechanism in which every node becoming aware of an information at step t forwards this information to all its neighbors at all forthcoming steps t∦ t. In this paper, we establish tight bounds on the complexity of flooding for all possible birth rates and death rates, completing the previous results by Clementi et al. Moreover, we note that despite its many advantages in term of simplicity and robustness, flooding suffers from its high bandwidth consumption. Hence we also show that flooding in dynamic graphs can be implemented in a more parsimonious manner, so that to save bandwidth, yet preserving efficiency in term of simplicity and completion time. For a positive integer k, we say that the flooding protocol is k-active if each node forwards an information only during the k time steps immediately following the step at which the node receives that information for the first time. We define the reachability threshold for the flooding protocol as the smallest integer k such that, for any source s ∈ [n], the k-active flooding protocol from s completes (i.e., reaches all nodes), and we establish tight bounds for this parameter. We show that, for a large spectrum of parameters p and q, the reachability threshold is by several orders of magnitude smaller than the flooding time. In particular, we show that it is even constant whenever the ratio p/(p + q) exceeds log n/n. Moreover, we also show that being active for a number of steps equal to the reachability threshold (up to a multiplicative constant) allows the flooding protocol to complete in optimal time, i.e., in asymptotically the same number of steps as when being perpetually active. These results demonstrate that flooding can be implemented in a practical and efficient manner in dynamic graphs. The main ingredient in the proofs of our results is a reduction lemma enabling to overcome the time dependencies in edge-Markovian dynamic graphs.