Tight Analyses of Two Local Load Balancing Algorithms
SIAM Journal on Computing
SIAM Journal on Computing
Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
The random trip model: stability, stationary regime, and perfect simulation
IEEE/ACM Transactions on Networking (TON)
Understanding the simulation of mobility models with Palm calculus
Performance Evaluation
Discrete Applied Mathematics
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
An analytical study of fundamental mobility properties for encounter-based protocols
International Journal of Autonomous and Adaptive Communications Systems
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
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences
MANETS: High Mobility Can Make Up for Low Transmission Power
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
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
Information propagation speed in mobile and delay tolerant networks
IEEE Transactions on Information Theory
Dynamic networks: models and algorithms
ACM SIGACT News
Modelling mobility: A discrete revolution
Ad Hoc Networks
Tight bounds on information dissemination in sparse mobile networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Information Spreading in Stationary Markovian Evolving Graphs
IEEE Transactions on Parallel and Distributed Systems
Flooding Time of Edge-Markovian Evolving Graphs
SIAM Journal on Discrete Mathematics
Information dissemination via random walks in d-dimensional space
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Mobile geometric graphs: detection, coverage and percolation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
| Hi-index | 0.00 |
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary ergodic Markovian dynamic graph process, that is, processes in which the topology of the graph at time t depends only on its topology at time t-1 and which have a unique stationary distribution. The most well studied models of dynamic graphs are all Markovian and ergodic. Under general conditions, we bound the flooding time in terms of the mixing time of the dynamic graph process. We recover, as special cases of our result, bounds on the flooding time for the random trip model and the random path models; previous analysis techniques provided bounds only in restricted settings for such models. Our result also provides the first bound for the random waypoint model (which is tight for the most realistic ranges of network parameters) whose analysis had been an important open question.