Autonomous Gossiping of Information in a P2P Network with Artificial Ants

They appeared in our life some years ago with the awakening of the PC and now the are everywhere : computers have become ubiquitous and, almost, irreplaceable. Classical ways of creating, managing and exchanging information have been progressively replaced by electronic means. In spite of this plebiscite, computer supported collaborative work (CSCW) softwares can be blamed for requiring the user to do an effort to use them. This paper describes an artificial ant based autonomous information dissemination algorithm. It constitutes the communication layer of our framework PIAF (“Personal Intelligent Agent Framework”) intended to help users transparently sharing information. The algorithm uses message gossiping strategy to transfer information items between users.

[1]  Herman Lam,et al.  Event and rule services for achieving a Web-based knowledge network , 2004, Knowl. Based Syst..

[2]  John Seely Brown,et al.  The Origins of Ubiquitous Computing Research at PARC in the Late 1980s , 1999, IBM Syst. J..

[3]  Mike Burmester,et al.  Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks , 2007, Ad Hoc Networks.

[4]  Jonathan Grudin,et al.  Why CSCW Applications Fail: Problems in the Design and Evaluation of Organization of Organizational Interfaces. , 1988 .

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

[6]  Bart Selman,et al.  Agent Amplified Communication , 1996, AAAI/IAAI, Vol. 1.

[7]  Luciano Serafini,et al.  Extending Multi-agent Cooperation by Overhearing , 2001, CoopIS.

[8]  Nicolas Monmarché,et al.  Sharing resources with artificial ants , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[9]  Christoph Schmitz.  Self-Organization of a Small World by Topic , 2004, LWA.

[10]  David W. Payton.  Discovering Collaborators by Analyzing Trails Through an Information Space , 1998 .

[11]  Frank van Harmelen,et al.  Peer Selection in Peer-to-Peer Networks with Semantic Topologies , 2004, ICSNW.

[12]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[13]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[14]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[15]  Bart Selman,et al.  Referral Web: combining social networks and collaborative filtering , 1997, CACM.

[16]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[17]  Jonathan Grudin,et al.  Why CSCW applications fail: problems in the design and evaluationof organizational interfaces , 1988, CSCW '88.

[18]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.