Information Spreading in Stationary Markovian Evolving Graphs

@article{Clementi2009InformationSI,
  title={Information Spreading in Stationary Markovian Evolving Graphs},
  author={Andrea E. F. Clementi and Angelo Monti and Francesco Pasquale and Riccardo Silvestri},
  journal={IEEE Transactions on Parallel and Distributed Systems},
  year={2009},
  volume={22},
  pages={1425-1432}
}
Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network scenarios. We study the speed of information spreading in the stationary phase by analyzing the completion time of the flooding mechanism. We prove a general theorem that establishes an upper bound on flooding time in any stationary Markovian evolving graph in… CONTINUE READING
Highly Cited
This paper has 109 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 68 extracted citations

Mobile Conductance in Sparse Networks and Mobility-Connectivity Tradeoff

IEEE Transactions on Wireless Communications • 2014
View 5 Excerpts
Highly Influenced

Gossip-Based Information Spreading in Mobile Networks

IEEE Transactions on Wireless Communications • 2013
View 9 Excerpts
Highly Influenced

Distributed Computing

John C. Mitchell, Bernhard Steffen, +4 authors Switzerland Moni Naor
Lecture Notes in Computer Science • 2012
View 10 Excerpts
Highly Influenced

On the Expansion and Diameter of Bluetooth-Like Topologies

Theory of Computing Systems • 2012
View 4 Excerpts
Highly Influenced

Order-Optimal Information Dissemination in MANETs via Network Coding

IEEE Transactions on Parallel and Distributed Systems • 2014
View 7 Excerpts
Highly Influenced

Mobile conductance and gossip-based information spreading in mobile networks

2013 IEEE International Symposium on Information Theory • 2013
View 5 Excerpts
Highly Influenced

Parsimonious flooding in dynamic graphs

Distributed Computing • 2009
View 10 Excerpts
Highly Influenced

110 Citations

01020'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 110 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…