Flooding time of edge-Markovian evolving graphs

SIAM Journal on Discrete Mathematics

Volumn 24, Issue 4, 2010, Pages 1694-1712

  Clementi, Andrea E F ^a   Macci, Claudio ^a   Monti, Angelo ^b   Pasquale, Francesco ^c   Silvestri, Riccardo ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF SALERNO   (Italy)

Author keywords

Flooding; Markov processes; Random graphs

Indexed keywords

COMPLETION TIME; DEATH RATES; EVOLVING GRAPH MODELS; EVOLVING GRAPHS; FLOODING; FLOODING MECHANISM; INITIAL GRAPH; MARKOVIAN; MARKOVIAN PROCESS; MIXING TIME; RANDOM GRAPHS; SOURCE NODES; TIGHT BOUND; TIME STEP; TWO-STATE;

ASYMPTOTIC ANALYSIS; GRAPH THEORY; MARKOV PROCESSES; POPULATION STATISTICS; PROBABILITY;

GRAPHIC METHODS;

EID: 79251545188     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/090756053     Document Type: Article

References (22)

1. C. AVIN, M. KOUCKÝ, AND Z. LOTKER, How to explore a fast-changing world, in Proceedings of the 35th International Colloquium on Automata, Languages and Programming, 2008, Springer, pp. 121-132.
2. R. BAR-YEHUDA, O. GOLDREICH, AND A. ITAI, On the time-complexity of broadcast in mult-hop radio networks: An exponential gap between determinism and randomization, J. Comput. System Sci., 45(1992), pp. 104-126.
3. H. BAUMANN, P. CRESCENZI, AND P. FRAIGNIAUD, Parsimonious flooding in dynamic graphs, in Proceedings of the 28th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2009, ACM Press, pp. 260-269.
4. B. BOLLOBÁS, The diameter of random graphs, Trans. Amer. Math. Soc., 276(1981), pp. 41-52.
5. B. BOLLOBÁS, Random Graphs, Cambridge University Press, Cambridge, UK, 2001.
6. N. B. CHANG AND M. LIU, Optimal controlled flooding search in a large wireless network, in Proceedings of the 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2005, IEEE Computer Society, pp. 229-237.
7. F. CHUNG AND L. LU, The diameter of sparse random graphs, Adv. in Appl. Math., 26(2001), pp. 257-279.
8. A. E. F. CLEMENTI, A. MONTI, F. PASQUALE, AND R. SILVESTRI, Broadcasting in dynamic radio networks, J. Comput. System Sci., 75(2009), pp. 213-230.
9. A. E. F. CLEMENTI, A. MONTI, F. PASQUALE, AND R. SILVESTRI, Information spreading in stationary markovian evolving graphs, in Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium, 2009, IEEE Computer Society, pp. 1-12.
10. S. N. DOROGOVTSEV AND J. F. F. MENDES, Evolution of Networks, Oxford University Press, Oxford, NY, 2003.
11. P. ERDÖS AND A. RÉNYI, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci., 5(1960), pp. 17-61.
12. M. M. C. GKANTSIDIS AND A. SABERI, Hybrid search schemes for unstructured peer-to-peer networks, in Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005, pp. 1526-1537.
13. Gnutella, http://rfc-gnutella.sourceforge.net, 2002.
14. S. M. HEDETNIEMI, S. T. HEDETNIEMI, AND A. L. LIESTMAN, A survey of gossiping and broadcasting in communication networks, Networks, 18(1988), pp. 319-349.
15. D. KEMPE AND J. KLEINBERG, Protocols and impossibility results for gossip-based communication mechanisms, in Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002, IEEE Computer Society, pp. 471-480.
16. J. LESKOVEC, J. KLEINBERG, AND C. FALOUTSOS, Graphs over time: Densification laws, shrinking diameters, and possible explanations, in Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005, ACM Press, pp. 177-187.
17. Q. LV, P. CAO, E. COHEN, K. LI, AND S. SHENKER, Search and replication in unstructured peerto-peer networks, in Proceedings of the 16th International Conference on Supercomputing, 2002, ACM Press, pp. 84-95. (Pubitemid 35039987)
18. D. A. LEVIN, Y. PERES, AND E. L. WILMER, Markov Chains and Mixing Times, American Mathematical Society, Providence, RI, 2008.
19. R. O'DELL AND R. WATTENHOFER, Information Dissemination in Highly Dynamic Graphs, in Proceedings of the ACM DIALM-POMC Joint Workshop on Fondations of Mobile Computing, 2005, pp. 104-110.
20. K. OIKONOMOU AND I. STAVRAKAKIS, Performace analysis of probabilistic flooding using random graphs, in Proceedings of the IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, 2007, IEEE Computer Society, pp. 1-6.
21. B. PITTEL, On spreading a rumor, SIAM J. Appl. Math., 47(1987), pp. 213-223.
22. C. SCHEIDELER, Models and Techniques for Communication in Dynamic Networks, in Proceedings of the 19th Symposium on Theoretical Aspects of Computer Science, 2002, Springer, pp. 27-49.