Information survival threshold in sensor and P2P networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1316-1324

  Chakrabarti, Deepayan ^a   Leskovec, Jure ^b   Faloutsos, Christos ^b   Madden, Samuel ^c,d   Guestrin, Carlos ^b   Faloutsos, Michalis ^e  

^a YAHOO RESEARCH   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c Architecture Machine Group

^d UNIVERSITY OF CALIFORNIA   (United States)

^e NONE

Author keywords

[No Author keywords available]

Indexed keywords

BLUETOOTH; COMPUTER VIRUSES; DISTRIBUTED COMPUTER SYSTEMS; DYNAMICAL SYSTEMS; EIGENVALUES AND EIGENFUNCTIONS; INFORMATION ANALYSIS; MOBILE PHONES;

FIXED POINT STABILITY THEOREMS; INFORMATION SURVIVAL THRESHOLD; NODE FAULT PROBABILITIES;

SENSOR NETWORKS;

EID: 34548312516     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.156     Document Type: Conference Paper

References (51)

1. L. Allen and A. Burgin. Comparison of deterministic and stochastic sis and sir models in discrete time. Journal of Mathematical Bioscience, 163(1):1-33, 2000.
2. N. T. J. Bailey. The Mathematical Theory of Infectious Diseases and its Applications. Hafner Press, 2nd edition, 1975.
3. S. Bellovin, B. Cheswick, and A. D. Keromytis. Worm propagation strategies in an IPv6 Internet. ;LOGIN, 31(1), 2006.
4. K. P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, , and Y. Minsky. Bimodal multicast. ACM Transactions on Computer Systems, 17(2):41-88, 1999.
5. S. Boyd, A. Ghosh, B. Prabhakar, and D.Shah. Gossip and mixing times of random walks on random graphs. www.stanford.edu/~boyd/reports/ gossip_opt.pdf.
6. P. Bremaud. Markov chains, Gibbs fields, Monte Carlo simulation, and queues. Springer, New York, 1999.
7. M. Burns, A. George, and B. Wallace. Simulative performance analysis of gossip failure detection for scalable distributed systems. Cluster Computing, 2(2):207-217, 1999.
8. D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts. Network robustness and fragility: Percolation on random graphs. Physical Review Letters, 85, 2000.
9. D. Chakrabarti. Tools for large graph mining. Technical Report CMU-CALD-05-107, Carnegie Mellon University, 2005.
10. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. 2002.
11. J. Considine, F. Li, G. Kollios, and J. Byers. Approximate aggregation techniques for sensor databases. In ICDE, 2004.
12. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinchart, and D. Terry. Epidemic algorithms for replicated database maintenance. In PODC, 1987.
13. R. Durrett and X.-F. Liu. The contact process on a finite set. The Annals of Probability, 16(3):1158-1173, 1988.
14. R. Durrett and R. H. Schonmann. The contact process on a finite set II. The Annals of Probability, 16(4):1570-1583, 1988.
15. R. Durrett, R. H. Schonmann, and N. I. Tanaka. The contact process on a finite set III: The critical case. The Annals of Probability, 17(4):1303-1321, 1989.
16. D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker. An empirical study of epidemic algorithms in large scale multihop wireless networks. Technical Report IRB-TR-02-003, Intel Research, 2002.
17. A. Ganesh, D. Gunawardena, P. Key, L. Massoulie, and J. Scott. Efficient quarantining of scanning worms: Optimal detection and co-ordination. 2006.
18. A. Ganesh, L. Massoulié, and D. Towsley. The effect of network topology on the spread of epidemics. In INFOCOM, 2005.
19. M. Garetto, W. Gong, and D. Towsley. Modeling malware spreading dynamics. In INFOCOM, 2003.
20. M. Garofalakis and A. Kumar. Deterministic wavelet thresholding for maximum-error metrics. In PODS, 2004.
21. R. Guha, R. Kumar, P. Raghavan, and A. Tomkins. Propagation of trust and distrust. In WWW, 2004.
22. I. Gupta, K. Birman, P. Linga, A. Demers, and R. van Renesse. Kelips: Building an efficient and stable p2p dht through increased memory and background overhead. In Proceedings of the International Workshop on Peer-to-Peer Systems, 2003.
23. I. Gupta, A.-M. Kermarrec, and A. J. Ganesh. Efficient epidemic-style protocols for reliable and scalable multicast. In SRDS, 2002.
24. T. E. Harris. Contact interactions on a lattice. Annals of Probability, 2:969-988, 1974.
25. M. W. Hirsch and S. Smale. Differential Equations, Dynamical Systems, and Linear Algebra. Academic Press, 1974.
26. B. Hull, K. Jamieson, and H. Balakrishnan. Mitigating congestion in wireless sensor networks. In SenSys, pages 134-147, 2004.
27. http://db.lcs.mit.edu/labdata/labdata.html.
28. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Symposium on Foundations of Computer Science (FOCS), 2003.
29. D. Kempe and J. Kleinberg. Protocols and impossibility results forgossip-based communication mechanisms. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), 2002.
30. D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. In ACM STOC, 2001.
31. J. O. Kephart and S. R. White. Directed-graph epidemiological models of computer viruses. In IEEE Symposium on Research in Security and Privacy, 1991.
32. J. Kim, S. Radhakrishnan, and S. K. Dhall. Measurement and analysis of worm propagation on internet network topology. In Internation Conference on Communication in Computer Networks, 2004.
33. P. Levis, N. Patel, S. Shenker, and D. Culler. Trickle: A self-regulating mechanism for code propagation and maintenance in wireless networks. In Proceedings of NSDI, 2004.
34. T. M. Liggett. Interacting Particle Systems. Springer Verlag, 1985.
35. C. Lindemann and O. P. Waldhorst. Modeling epidemic information dissemination on mobile devices with finite buffers. In SIGMETRICS, 2005.
36. J. Luo, P. T. Eugster, and J.-P. Hubaux. Route driven gossip: Probabilistic reliable multicast in ad hoc networks. In IEEE INFOCOM, 2003.
37. D. Moore, V. Paxson, S. Savage, C. Shannon, S. Staniford, and N. Weaver. An analysis of the sapphire/slammer worm, 2003.
38. R. V. Renesse. Scalable and secure resource location. In Hawaii International Conference on System Sciences, 2000.
39. R. V. Renesse, R. Minsky, and M. Hayden. A gossip-style failure detection service. In Conference on Distributed Systems Platforms and Open Distributed Processing Middleware, 1998.
40. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a DHT. In USENIX, 2004.
41. M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal, 6(1), 2002.
42. K. Sistla, A. George, R. Todd, and R. Tilak. Performance analysis of flat and layered gossip services for failure detection and consensus in heterogeneous cluster computing. In Proceedings of the Heterogeneous Computing Workshop (HCW) at the International Parallel and Distributed Processing Symposium (IPDPS), 2001.
43. S. Staniford, V. Paxson, and N. Weaver. How to Own the internet in your spare time. In USENIX Security Symposium, 2002.
44. S. Tanachaiwiwat and A. Helmy. VACCINE: War of the worms in wired and wireless networks. In INFOCOM, 2006.
45. R. W. Thommes and M. J. Coates. Epidemiological modelling of peerto-peer viruses and pollution. 2006.
46. S.-C. Wang and S.-Y. Kuo. Communication strategies for heartbeat-style failure detectors in wireless ad hoc networks. In DSN, 2003.
47. Y. Wang, D. Chakrabarti, C. Wang, and C. Faloutsos. Epidemic spreading in real networks: An eigenvalue viewpoint. In SRDS, 2003.
48. Y. Wang and C. Wang. Modeling the effects of timing parameters on virus propagation. In Proceedings of the ACM workshop on Rapid Malcode, 2003.
49. X. Zhang, G. Neglia, J. Kurose, and D. Towsley. Performance modeling of epidemic routing. In IFIP Networking, 2006.
50. S. Q. Zhuang, D. Geels, I. Stoica, and R. H. Katz. On failure detection algorithms in overlay networks. In IEEE INFOCOM, 2005.
51. C. Zou, D. Towsley, and W. Gong. Email worm modeling and defense. Technical report, 2004.