Skip to main content
SpringerLink
Log in

Nature-Inspired Dissemination of Information in P2P Networks

  • Chapter
  • First Online:
Book cover Computational Social Network Analysis

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

After having first been used as a means to publish content, the Web is now widely used as a social tool for sharing information. It is an easy task to subscribe to a social network, join one of the Web-based communities according to some personal interests and start to share content with all the people who do the same. It is easy once you solve two basic problems: select the network to join (go to hi5, facebook, myspace,…? join all of them?) and find/pick up the right communities (i.e., find a strict label to match non-strict centers of interest). An error of appreciation would result in getting too much of useless/non-relevant information. This chapter provides a study on the dissemination of information within groups of people and aim at answering one question: can we find an effortless way of sharing information on the Web? Ideally, such a solution would require neither the definition of a profile nor the selection of communities to join. Publishing information should also not be the result of an active decision but be performed in an automatic way. A nature-inspired framework is introduced as an answer to this question. This framework features artificial ants taking care of the dissemination of information items within the network. Centers of interest of the users are reflected by artificial pheromones laid down on connections between peers. Another part of the framework uses those pheromone trails to detect shared interests and creates communities.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note that in case of a directed graph, a distinction would be made between the in and out degrees.

  2. 2.

    Under the assumption that Δt is very short, continuous models can be derived from discrete equation systems [1].

References

  1. Allen L (1994) Some discrete-time si, sir and sis epidemic models. Math Biosci 124(1):83–105

    Article  MATH  Google Scholar 

  2. Babaoglu O, Meling H, Montresor A (2002) Anthill: A framework for the development of agent-based peer-to-peer systems. In: Proceedings of the 22th international conference on distributed computing systems (ICDCS ‘02), Vienna, Austria

    Google Scholar 

  3. Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286:509

    Article  MathSciNet  Google Scholar 

  4. Bonsma E (2002) Fully decentralised, scalable look-up in a network of peers using small world networks. In: Proceedings of the 6th multiple conference on systemics, cybernetics and informatics, Orlando

    Google Scholar 

  5. Burmester M, Le TV, Yasinsac A (2006) Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks. J Ad Hoc Networks 4(3):504–515, DOI 10.1016/j.adhoc.2005.11.007

    Google Scholar 

  6. Carzaniga A, Rosenblum DS, Wolf AL (2000) Achieving expressiveness and scalability in an internet-scale event notification service. In: Proceedings of the 19th ACM symposium on principles of distributed computing (PODC2000), Portland, Oregon

    Google Scholar 

  7. Carzaniga A, Rosenblum DS, Wolf AL (2001) Design and evaluation of a wide-area event notification service. ACM Trans Comput Syst 19(3):332–383

    Article  Google Scholar 

  8. Cheriton D (1992) Dissemination oriented communication systems. Tech. Rep., Stanford University, Computer Science Department

    Google Scholar 

  9. Demers AJ, Greene DH, Hauser C, Irish W, Larson J, Shenker S, Sturgis HE, Swinehart DC, Terry DB (1988) Epidemic algorithms for replicated database maintenance. Oper Syst Rev 22(1):8–32

    Article  Google Scholar 

  10. Dorigo M, Maniezzo V, Colorni A (1996) The Ant System: Optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybernet Part B Cybernet 26(1):29–41

    Article  Google Scholar 

  11. Franklin M, Zdonik S (1997) A framework for scalable dissemination-based systems. In: Proceedings of the 12th ACM SIGPLAN conference on object-oriented programming, systems, languages, and applications (OOPSLA’97), ACM, New York, NY, USA, pp 94–105, DOI 10.1145/263698.263725

    Google Scholar 

  12. Franklin M, Zdonik S (1998) Data in your face: Push technology in perspective. In: Proceedings of the 1998 ACM SIGMOD international conference on Management of data (SIGMOD’98), ACM, New York, NY, USA, pp 516–519, DOI 10.1145/276304.276360

    Google Scholar 

  13. Ganguly N, Canright G, Deutsch A (2005) Design of a robust search algorithm for p2p networks. In: Heidelberg SB (ed) High performance computing – HiPC 2004, Lecture Notes in Computer Science, vol 3296, pp 222–231, DOI 10.1007/b104576

    Google Scholar 

  14. Guéret C (2006) Navigateurs internet intelligents: Algorithmes de fourmis artificielles pour la diffusion d’informations dans un réseau p2p. PhD thesis, Université François Rabelais Tours, Laboratoire d’Informatique, 64, Avenue Jean Portalis – 37200 Tours

    Google Scholar 

  15. Guéret C, Monmarché N, Slimane M (2004) Spreading information within a p2p network using artificial ants. In: Proceedings of the 8th annual meeting on health, science and technology

    Google Scholar 

  16. Guéret C, Monmarché N, Slimane M (2005) Aide à la navigation sur internet: Utilisation de fourmis artificielles pour l’échange d’informations dans un réseau p2p. In: Actes du congré de la ROADEF

    Google Scholar 

  17. Guéret C, Monmarché N, Slimane M (2006a) Automonous gossiping of information in a P2P network with artificial ants. In: Dorigo M, Gambardella LM, Birattari M, Martinoli A, Poli R, Stützle T (eds) Proceedings of the 5th international workshop on ant colony optimization and swarm intelligence (ANTS’2006). Springer, Bruxelles, Belgium, Lecture Notes in Computer Science (LNCS), vol 4150, pp 388–395

    Google Scholar 

  18. Guéret C, Monmarché N, Slimane M (2006b) A self-organizing ant-based information gossiping algorithm for P2P networks. In: Proceedings of the 6th international workshop on innovative Internet community systems (I2CS’2006), German Society of Informatics, Neuchâtel, Lecture notes in informatics (LNI), p 10

    Google Scholar 

  19. Guéret C, Monmarché N, Slimane M (2006c) Sharing resources with artificial ants. In: Proceedings of the 9th international workshop on nature inspired distributed computing (NIDISC’06), at the 20th IEEE international parallel and distributed processing symposium (IPDPS’2006), Rhodes Island, p 8

    Google Scholar 

  20. Guéret C, Monmarché N, Slimane M (2007a) A biology-inspired model for the automatic dissemination of information in p2p networks. Nature-inspired systems for parallel, asynchronous and decentralised environments (NISPADE), Special issue of multiagent and grid systems (MAGS) 3(1):87–104

    Google Scholar 

  21. Guéret C, Monmarché N, Slimane M (2007b) Sharing resources in a p2p network with artificial ants. J Math Model Algorithms (JMMA) 6:345–360, DOI 10.1007/s10852-007-9062-9

    Article  MATH  Google Scholar 

  22. Hethcote HW, van den Driessche P (1991) Some epidemiological models with nonlinear incidence. J Math Biol 29:271–287

    Article  MATH  MathSciNet  Google Scholar 

  23. Hethcote HW, van den Driessche P (1995) An sis epidemic model with variable population size and a delay. J Math Biol 34:177–194

    Article  MATH  MathSciNet  Google Scholar 

  24. Hethcote HW, Levin S (1989) Periodicity in epidemiological models. Appl Math Ecol 1:193–211

    MathSciNet  Google Scholar 

  25. Hui KYK, Lui JCS, Yau DKY (2004) Small world overlay p2p networks. In: Proceedings of IEEE international workshop on quality of service (IWQoS), Montreal, Canada

    Google Scholar 

  26. Iaminitchi A, Ripeanu M, Foster IT (2002) Locating data in (small-worlds?) peer-to-peer scientific collaborations. Lecture Notes in Computer Science, Revised papers from the 1st international workshop on peer-to-peer systems 2429:232–241

    Google Scholar 

  27. Intanagonwiwat C, Govindan R, Estrin D (2000) Directed diffusion: A scalable and robust communication paradigm for. Sensor networks. In: Proceedings of the 6th annual ACM/IEEE international conference on mobile computing and networking (MobiCOM00), Boston, MA, USA, pp 56–67

    Google Scholar 

  28. Jelasity M, Babaoglu O (2004) T-Man: Fast gossip-based construction of large-scaleoverlay topologies. Tech. Rep. UBLCS-2004-7, University of Bologna, Department of Computer Science, Bologna, Italy

    Google Scholar 

  29. Jelasity M, Babaoglu O (2005) T-man: Gossip-based overlay topology management. In: Brueckner S, Serugendo GDM, Hales D, Zambonelli F (eds) Engineering self-organising applications (ESOA’05), Utrecht, The Netherlands

    Google Scholar 

  30. Joseph S, Hoshiai T (2003) Decentralized meta-data strategies: Effective peer-to-peer search. IEICE Trans Commun E86-B(6):1740–1753

    Google Scholar 

  31. Koubarakis M, Tryfonopoulos C (2004) Distributed resource sharing using self-organized peer-to-peer networks and languages from information retrieval. In: Invitational workshop on self-*properties in complex information systems, Bertinoro, Italy

    Google Scholar 

  32. Koubarakis M, Tryfonopoulos C, Idreos S, Drougas Y (2003) Selective information dissemination in p2p networks: Problems and solutions. SIGMOD Record, Special Issue on Peer-to-Peer Data Management 32(3):71–76

    Google Scholar 

  33. Leveille J (2002) Epidemic spreading in technological networks. Tec. Rep. HPL-2002-287, Information infrastructure laboratory, HP Laboratories Bristol

    Google Scholar 

  34. Lin M, Marzullo K (1999) Directional gossip: Gossip in a wide area network. Tech. Rep., La Jolla, CA, USA

    Google Scholar 

  35. Montresor A (2001) Anthill: A framework for the design and analysis of peer-to-peer systems. In: Proceedings of the 4th European research seminar on advances in distributed systems, Bertinoro, Italy

    Google Scholar 

  36. Montresor A, Meling H, Babaoglu O (2002) Messor: Load-balancing through a swarm of autonomous agents. Tech. Rep. UBLCS-02-08, Departement of Computer Science, University of Bologna, Bologna, Italy

    Google Scholar 

  37. Palau J, Montaner M, López B (2004) Collaboration analysis in recommender systems using social networks. In: Proceedings of the 8th international workshop on cooperative information agents (CIA’04), Erfurt (Germany)

    Google Scholar 

  38. Plaxton CG, Rajaraman R, Richa AW (1997) Accessing nearby copies of replicated objects in a distributed environment. In: Proceedings of the ninth annual ACM symposium on parallel algorithms and architectures (SPAA’97), ACM, New York, NY, USA, pp 311–320, DOI 10.1145/258492.258523

    Google Scholar 

  39. Ratnasamy S, Francis P, Handley M, Karp R, Schenker S (2001) A scalable content-addressable network. In: SIGCOMM ’01: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, ACM, New York, NY, USA, pp 161–172, DOI 10.1145/383059.383072

    Google Scholar 

  40. Risson J, Moors T (2004) Survey of research towards robust peer-to-peer networks: Search methods. Tec. Rep. UNSW-EE-P2P-1-1, University of New South Wales, Australia

    Google Scholar 

  41. Rowstron A, Druschel P (2001) Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems. IFIP/ACM international conference on distributed systems platforms (Middleware)

    Google Scholar 

  42. Roy CR, Kyasanur P, Gupta I (2006) Smart gossip: An adaptive gossip-based broadcasting service for sensor networks. In: Proceedings of the IEEE MASS

    Google Scholar 

  43. Schmitz C (2004) Self-organization of a small world by topic. In: Proceedings of the 1st international workshop on peer-to-peer knowledge management (P2PKM)

    Google Scholar 

  44. Segall B, Arnold D, Boot J, Henderson M, Phelps T (2000) Content based routing with elvin4. In: Proceedings of AUUG2K

    Google Scholar 

  45. Sripanidkulchai K, Maggs B, Zhang H (2003) Efficient content location using interest-based locality in peer-to-peer systems. In: Proceedings of IEEE Infocom, San Francisco, p 11

    Google Scholar 

  46. Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H (2003) Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans Netw 11(1):17–32, DOI 10.1109/TNET.2002.808407

    Article  Google Scholar 

  47. Tempich C, Staab S, Wranik A (2004) Remindin: Semantic query routing in peer-to-peer networks based on social metaphors. In: Proceedings of the 13th World Wide Web conference (WWW2004), New York, USA, pp 640–649

    Google Scholar 

  48. Voulgaris S, Kermarrec AM, Massoulie L, van Steen M (2004) Exploiting semantic proximity in peer-to-peer content searching. In: Proceedings of the 10th IEEE international workshop on future trends in distributed computing systems (FTDCS 2004), Suzhou, China

    Google Scholar 

  49. Wokoma I, Sacks L, Marshall I (2002) Biologically inspired models for sensor network design. In: Proceedings of the London communications symposium 2002 (LCS 2002)

    Google Scholar 

  50. Zhao BY, Kubiatowicz JD, Joseph AD (2001) Tapestry: An infrastructure for fault-tolerant wide-area location and Tech. Rep., Berkeley, CA, USA

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vrije Universiteit, Amsterdam, The Netherlands

    Christophe Guéret

Authors
  1. Christophe Guéret
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christophe Guéret .

Editor information

Editors and Affiliations

  1. Scientific Network for Innovation &, Machine Intelligence Research Labs (MIR), Auburn, 98071-2259, U.S.A.

    Ajith Abraham

  2. Fac. Computers & Information, Cairo University, Ahmed Zewal Street 5, Giza, 12613, Egypt

    Aboul-Ella Hassanien

  3. Dept. Computer Science, Technical University Ostrava, Tr. 17. Listopadu 15, Ostrava, 708 33, Czech Republic

    Vaclav Sná¿el

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this chapter

Cite this chapter

Guéret, C. (2010). Nature-Inspired Dissemination of Information in P2P Networks. In: Abraham, A., Hassanien, AE., Sná¿el, V. (eds) Computational Social Network Analysis. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84882-229-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-229-0_10

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-228-3

  • Online ISBN: 978-1-84882-229-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation