Parsimonious flooding in dynamic graphs

Distributed Computing

Volumn 24, Issue 1, 2011, Pages 31-44

  Baumann, Hervé ^a   Crescenzi, Pierluigi ^b   Fraigniaud, Pierre ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC MECHANISM; COMPLETION TIME; DEATH RATES; DYNAMIC GRAPH; FLOODING PROTOCOL; MULTIPLICATIVE CONSTANTS; OPTIMAL TIME; ORDERS OF MAGNITUDE; POSITIVE INTEGERS; REACHABILITY; TIGHT BOUND; TIME DEPENDENCY; TIME STEP;

GRAPHIC METHODS;

EID: 80053594638     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-011-0133-9     Document Type: Article

References (30)

1. Alon N.; Spencer J.H.: The Probabilistic Method. Wiley, Colorado (2000)
2. Avin, C.; Koucký, M.; Lotker, Z.: How to explore a fast-changing world. In: Proceedings of 35th International Colloquium on Automata, Languages and Programming (ICALP), pp. 121-132 (2008)
3. Bollobás B.: Random Graphs. Cambridge University Press, Cambridge (2001)
4. Brauer, F.; van den Driessche, P.; Wu, J. (Eds): Mathematical epidemiology. Lecture Notes in Mathematics (Mathematical Biosciences Subseries) 1945, (2008)
5. Chakrabarti, D.; Leskovec, J.; Faloutsos, C.; Madden, S.; Guestrin, C.; Faloutsos, M.: Information survival threshold in sensor and P2P networks. In: Proceedings of 26th IEEE Conference on Computer Communications (INFOCOM), pp. 1316-1324 (2007) (Pubitemid 47334356)
6. N. Chang M. Liu 2007 Controlled flooding search in a large network IEEE/ACM Trans. Netw. 15 2 436 449 2350999 10.1109/TNET.2007.892880 (Pubitemid 46621621)
7. F. Chung L. Lu 2001 The diameter of sparse random graphs Adv. Appl. Math. 26 4 257 279 1826308 0977.05127 10.1006/aama.2001.0720 (Pubitemid 33668981)
8. A. Clementi C. Macci A. Monti F. Pasquale R. Silvestri 2010 Flooding time in edge-Markovian dynamic graphs SIAM J. Discret. Math. 24 4 1694 1712 2746717 05924703 10.1137/090756053
9. A. Clementi A. Monti F. Pasquale R. Silvestri 2009 Broadcasting in dynamic radio networks J. Comput. Syst. Sci. 75 4 213 230 2499870 1159.90327 10.1016/j.jcss.2008.10.004
10. Clementi, A.; Monti, A.; Pasquale, F.; Silvestri, R.: Information spreading in stationary Markovian evolving graphs. In: Proceedings of 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1-12 (2009)
11. Clementi, A.; Pasquale, F.; Silvestri, R.: MANETS: High mobility can make up for low transmission power. In: Proceedings of 36th International Colloquium on Automata, Languages and Programming (ICALP), pp. 387-398 (2009)
12. A. Demers D. Greene C. Hauser W. Irish J. Larson S. Shenker H. Sturgis D. Swinehart D. Terry 1988 Epidemic algorithms for replicated database maintenance Oper. Syst. Rev. 22 1 8 32 10.1145/43921.43922
13. M. Draief A. Ganesh L. Massoulié 2008 Thresholds for virus spread on networks Ann. Appl. Probab. 18 2 359 378 2398760 1137.60051 10.1214/07-AAP470
14. U. Feige D. Peleg P. Raghavan E. Upfal 1990 Randomized broadcast in networks Random Struct. Alg. 1 4 447 460 1138435 0712.68011 10.1002/rsa. 3240010406
15. P. Fraigniaud E. Lazard 1994 Methods and problems of communication in usual networks Discret. Appl. Math. 53 79 133 1291003 0818.94029 10.1016/0166-218X(94)90180-5
16. A. Frieze G. Grimmett 1985 The shortest-path problem for graphs with random arc-lengths Discret. Appl. Math. 10 57 77 770869 0608.05047 10.1016/0166-218X(85)90059-9 (Pubitemid 15475455)
17. Gnutella RFC. http://rfc-gnutella.sourceforge.net/
18. M. Grossglauser D. Tse 2002 Mobility increases the capacity of ad-hoc wireless networks IEEE/ACM Trans. Netw. 10 4 477 486 10.1109/TNET.2002.801403 (Pubitemid 35000391)
19. I. Gupta A.-M. Kermarrec A. Ganesh 2006 Efficient and adaptive epidemic-style protocols for reliable and scalable multicast IEEE Trans. Parallel Dist. Syst. 17 7 593 605 10.1109/TPDS.2006.85 (Pubitemid 43997183)
20. S. Hedetniemi S. Hedetniemi A. Liestman 1986 A survey of gossiping and broadcasting in communication networks Networks 18 319 349 964236 10.1002/net.3230180406
21. Hromković J.; Klasing R.; Monien B.; Peine R.: Dissemination of information in interconnection networks (broadcasting and gossiping). In: Du, D.-Z.; Hsu, D. (eds) Combinatorial Network Theory, pp. 125-212. Kluwer Academic, Dordrecht (1995)
22. Janson S.; Luczak T.; Rucinski A.: Random Graphs. Wiley, Dordrecht (2000)
23. Kempe, D.; Dobra, A.; Gehrke, J.: Computing aggregate information using gossip. In: Proceedings of 44th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 482-491 (2003)
24. D. Kempe J. Kleinberg A. Demers 2004 Spatial gossip and resource location protocols J. ACM 51 6 943 967 2145259 1125.68326 10.1145/1039488.1039491 (Pubitemid 40818311)
25. Kempe, D.; Kleinberg, J.: Protocols and impossibility results for gossip-based communication mechanisms. In: Proceedings of 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 471-480 (2002)
26. Luo, J.; Eugster, P.; Hubaux, J.-P.: Route driven gossip: probabilistic reliable multicast in ad hoc networks. In: Proceedings of 22nd IEEE Conference on Computer Communications (INFOCOM), pp. 2229-2239 (2003)
27. Lv, Q.; Cao, P.; Cohen, E.; Li, K.; Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of 16th ACM International Conference on Supercomputing (ICS), pp. 84-95 (2002) (Pubitemid 35039987)
28. B. Pittel 1987 On spreading a rumour SIAM J. Appl. Math. 47 213 223 873245 0619.60068 10.1137/0147013
29. Sarwate, A.; Dimakis, A.: The impact of mobility on gossip algorithms. In: Proceedings of 28th IEEE Conference on Computer Communications (INFOCOM), pp. 2088-2096 (2009)
30. Sripanidkulchai, K.; Maggs, B.; Zhang, H.: Efficient content location using interest-based locality in peer-to-peer systems. In: Proceedings of 22nd IEEE Conference on Computer Communications (INFOCOM), pp. 2166-2176 (2003)