An analytical model for multi-epidemic information dissemination

Contemporary distributed systems usually involve the spreading of information by means of ad-hoc dialogs between nodes (peers). This paradigm resembles the spreading of a virus in the biological perspective (epidemics). Such abstraction allows us to design and implement information dissemination schemes with increased efficiency. In addition, elementary information generated at a certain node can be further processed to obtain more specific, higher-level and more valuable information. Such information carries specific semantic value that can be further interpreted and exploited throughout the network. This is also reflected in the epidemical framework through the idea of virus transmutation which is a key component in our model. We establish an analytical framework for the study of a multi-epidemical information dissemination scheme in which diverse 'transmuted epidemics' are spread. We validate our analytical model through simulations. Key outcomes of this study include the assessment of the efficiency of the proposed scheme and the prediction of the characteristics of the spreading process (multi-epidemical prevalence and decay).

[1]  Chuanyi Ji,et al.  Spatial-temporal modeling of malware propagation in networks , 2005, IEEE Transactions on Neural Networks.

[2]  Anne-Marie Kermarrec,et al.  Probabilistic Reliable Dissemination in Large-Scale Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[3]  Özgür Ulusoy,et al.  A comparison of epidemic algorithms in wireless sensor networks , 2006, Comput. Commun..

[4]  Kenji Leibnitz,et al.  Modeling of Epidemic Diffusion in Peer-to-Peer File-Sharing Networks , 2006, BioADIT.

[5]  Stathes Hadjiefthymiades,et al.  On the application of epidemical spreading in collaborative context-aware computing , 2009, MOCO.

[6]  Karl Aberer,et al.  Autonomous Gossiping: A Self-Organizing Epidemic Algorithm for Selective Information Dissemination in Wireless Mobile Ad-Hoc Networks , 2004, ICSNW.

[7]  Stathes Hadjiefthymiades,et al.  An innovative architecture for context foraging , 2009, MobiDE.

[8]  Stephen P. Boyd,et al.  A space-time diffusion scheme for peer-to-peer least-squares estimation , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[9]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[10]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[11]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[12]  Stathes Hadjiefthymiades,et al.  MNISIKLIS:Indoor Location Based Services for All , 2009 .

[13]  Vinny Cahill,et al.  A Taxonomy of Collaborative Context-Aware Systems , 2006, UMICS.

[14]  Matthew Chalmers,et al.  Three applications for mobile epidemic algorithms , 2005, Mobile HCI.

[15]  Jeffrey O. Kephart,et al.  Directed-graph epidemiological models of computer viruses , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[16]  Christian Becker,et al.  An epidemic model for information diffusion in MANETs , 2002, MSWiM '02.

[17]  Jon M. Kleinberg,et al.  Spatial gossip and resource location protocols , 2004, J. ACM.

[18]  Eli Upfal,et al.  Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.

[19]  Christos Faloutsos,et al.  Epidemic spreading in real networks: an eigenvalue viewpoint , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[20]  Johan Himberg,et al.  Collaborative context determination to support mobile terminal applications , 2002, IEEE Wirel. Commun..

[21]  Stathes Hadjiefthymiades,et al.  On the use of epidemical information spreading in mobile computing environments , 2008 .

[22]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[23]  Michael Sampels,et al.  Deterministic small-world networks , 2002 .

[24]  Axel Küpper.  Location-based Services: Fundamentals and Operation , 2005 .