Evolving P2P overlay networks with Tags, SLAC and SLACER for Cooperation and possibly other things… Saarbrücken SP6 workshop July 19-20th 2005 Presented.

Slides:



Advertisements
Similar presentations
ALMA MATER STUDIORUM – UNIVERSITA DI BOLOGNA ALMA MATER STUDIORUM – UNIVERSITA DI BOLOGNA Gossipping in Bologna Ozalp Babaoglu.
Advertisements

Reinforcement Learning
Evolving Cooperation in the N-player Prisoner's Dilemma: A Social Network Model Dept Computer Science and Software Engineering Golriz Rezaei Michael Kirley.
Distributed Advice-Seeking on an Evolving Social Network Dept Computer Science and Software Engineering The University of Melbourne - Australia Golriz.
SP 5: Biologically Inspired Techniques for “Organic IT” Final Year Report Participants UniBO, UPF, Telenor, RAL Lead partner: Bologna (UniBO)
Solving Collective Commons Problems: Future Scenarios for P2P Finance David Hales, University of Szeged, Hungary Diversity in Macro.
UNIVERSITY OF JYVÄSKYLÄ Building NeuroSearch – Intelligent Evolutionary Search Algorithm For Peer-to-Peer Environment Master’s Thesis by Joni Töyrylä
Altruistic Routing in P2P Networks: Solutions and Problems Sukumar Ghosh Alina Bejan Amlan Bhattacharya University of Iowa.
Denial-of-Service Resilience in Peer-to-Peer Systems D. Dumitriu, E. Knightly, A. Kuzmanovic, I. Stoica and W. Zwaenepoel Presenter: Yan Gao.
Tags and Image Scoring for Robust Cooperation By Nathan Griffiths Presented at AAMAS 2008.
AITIA International Inc. and Lorand Eotvos University, Budapest ROBUST NETWORKS FROM LOCAL OPTIMIZATION A Bottom-Up Model to Generate Networks with Skewed.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
Genetic Algorithms and Their Applications John Paxton Montana State University August 14, 2003.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery Using NeuroSearch Presentation for the Agora Center InBCT-seminar Mikko Vapa, researcher InBCT 3.2.
University of Bologna, Italy How to cheat BitTorrent and why nobody does Simon Patarin and David Hales University of Bologna ECCS 2006,
Project funded by the Future and Emerging Technologies arm of the IST Programme Recent directions in DELIS / Overview of on-going work David Hales
Cooperation through the endogenous evolution of social structure David Hales & Shade Shutters The Open University & Arizona State University
Peer to Peer Research survey TingYang Chang. Intro. Of P2P Computers of the system was known as peers which sharing data files with each other. Build.
CSS-TW1 Cooperation in Selfish Systems incorporating TagWorld I Welcome! David Hales, University of Bologna.
Dresden, ECCS’07 06/10/07 Science of complex systems for socially intelligent ICT Overview of background document Objective IST FET proactive.
Week 3a Mechanisms for Adaptation. POLS-GEOG-SOC 495 Spring Lecture Overview Review –CAS –Principles of chaos How do systems “learn”? –“Credit.
SP 5: Biologically Inspired Techniques for “Organic IT” Report for months Participants UniBO, UPF, Telenor, RAL Lead partner: Bologna (UniBO)
Towards Cooperative Self- Organized Replica Management Work in Progress David Hales, Andrea Marcozzi (University of Bologna) Giovanni Cortese (University.
Project funded by the Future and Emerging Technologies arm of the IST Programme Cooperation with Strangers David Hales Department of.
Example Department of Computer Science University of Bologna Italy ( Decentralised, Evolving, Large-scale Information Systems (DELIS)
Rationality meets the tribe: Some models of cultural group selection David Hales, The Open University Hales, D., (2010) Rationality.
Engineering with Sociological Metaphors: Examples and Prospects University of Bologna This work is partially supported by the European.
SLAC and SLACER: Simple copy & rewire algorithms for trust and cooperation in P2P David Hales, Stefano Arteconi, Ozalp Babaoglu University of Bologna,
SP 5: Biologically Inspired Techniques for “Organic IT” Plan for months Participants UniBO, UPF, Telenor, TILS presented by David Hales (UniBO)
Project funded by the Future and Emerging Technologies arm of the IST Programme Socially Inspired Approaches to Evolving Cooperation David Hales
Can Tags Build Working Systems? From MABS to ESOA Attempting to apply results gained from Multi-Agent- Based Social Simulation (MABSS)
P2P Interaction in Socially Intelligent ICT David Hales Delft University of Technology (Currently visiting University of Szeged, Hungary)
Multi-Patch Cooperative Specialists With Tags Can Resist Strong Cheaters, Bruce Edmonds, Feb 2013, ECMS 2013, Aalesund, Norway, slide 1 Multi-Patch Cooperative.
Evolving networks for cooperation Dagstuhl CCT3 DELIS Workshop Sept 3rd-4th 2005 Presented by David Hales University of Bologna, Italy
Self-Organising Networks of Services without Money or Contracts David Hales, University of Bologna, Italy First International Workshop and Summer School.
Freelib: A Self-sustainable Digital Library for Education Community Ashraf Amrou, Kurt Maly, Mohammad Zubair Computer Science Dept., Old Dominion University.
You are all social scientists: you just don’t know it yet David Hales (University of Bologna, Italy) SASO 2007, Cambridge. Mass.
Putting “tags” to work Attempting to apply results gained from agent- based social simulation (ABSS) to MAS. Dr David Hales
David Hales (University of Bologna) University of Bologna, Italywww.davidhales.com WARNING! Superficial sociological interpretation followed by simplistic.
Emergent Group-Like Selection in a Peer-to-Peer Network ECCS Conference Paris, Nov. 16 th, 2005 David Hales University of Bologna, Italy
Evolving cooperation in one-time interactions with strangers Tags produce cooperation in the single round prisoner’s dilemma and it’s.
Evolving Social Rationality for MAS using “Tags” Trying to “make things work” by applying results gained from Agent-Based Social Simulation.
Project funded by the Future and Emerging Technologies arm of the IST Programme From Selfish Nodes to Cooperative Networks – Emergent Link-based Incentives.
Project funded by the Future and Emerging Technologies arm of the IST Programme Understanding “tag” systems by comparing “tag” models David Hales
The Evolution of Specialisation in Groups – Tags (again!) David Hales Centre for Policy Modelling, Manchester Metropolitan University, UK.
Socially Inspired Computing Engineering with Social Metaphors.
Project funded by the Future and Emerging Technologies arm of the IST Programme Altruism “for free” using Tags David Hales Department.
Simple Rewire Protocols for Cooperation in Dynamic Networks David Hales, Stefano Arteconi, Ozalp Babaoglu University of Bologna, Italy Bio-Inspired Workshop,
Social Simulation for Self-* Systems: An idea whose time has come? David Hales University of Bologna, Italy In collaboration with: Stefano.
Evolving Specialisation, Altruism & Group-Level Optimisation Using Tags – The emergence of a group identity? David Hales Centre for Policy Modelling, Manchester.
Evolving Specialisation, Altruism & Group-Level Optimisation Using Tags David Hales Centre for Policy Modelling, Manchester Metropolitan University, UK.
Project funded by the Future and Emerging Technologies arm of the IST Programme Change your tags fast! - A necessary condition for cooperation? David Hales.
Evolution of Cooperation in Mobile Ad Hoc Networks Jeff Hudack (working with some Italian guy)
Emergent Group Selection: Tags, Networks and Society David Hales, The Open University ASU, Thursday, November 29th For more details.
Novel Models of Group Selection in Social Structures and Networks David Hales University of Bologna, Italy In collaboration with: Stefano.
Rationality and Power: the “gap in the middle” in ICT
The Matching Hypothesis
Web *.0 ? Combining peer production and peer-to-peer systems
Evolution for Cooperation
Paraskevi Raftopoulou, Euripides G.M. Petrakis
CASE − Cognitive Agents for Social Environments
Kick-off meeting University of Paderborn 18-19th March 2004
Socially Inspired Approaches to Evolving Cooperation
Group Selection Design Pattern
Self-Organising, Open and Cooperative P2P Societies – From Tags to Networks David Hales Department of Computer Science University of.
Kick-off meeting University of Paderborn 18-19th March 2004
Evolution for Cooperation
Altruism “for free” using Tags
Evolving cooperation in one-time interactions with strangers
Presentation transcript:

Evolving P2P overlay networks with Tags, SLAC and SLACER for Cooperation and possibly other things… Saarbrücken SP6 workshop July 19-20th 2005 Presented by David Hales University of Bologna, Italy

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 Bologna People / Overview Bologna (UniBO) involved in SP4, SP5 and SP6 directly People with some involvement in DELIS: Ozalp Babaoglu – DELIS site leader David Hales – DELIS postdoc (SP4..6 evolving networks) Stefano Arteconi – PhD student (SP5 evolving P2P networks) Mark Jelasity – BISON postdoc (SP6 distributed ranking) Edoardo Mollona – Faculty / DELIS (economics SP4)

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 Evolving networks for cooperation Ideas from Computational Social Science show how boundly rational simple greedy optimizers can, via their interactions, come to behave in a socially cooperative way Many mechanisms, some simple, some complex My interest: Tags (Holland, Riolo, Axelrod – Michigan group) Created mean-field single-round PD version (TagWorld) So far: adapted a mean-field abstract model (playing PD) into: simple network scenario playing PD (NetWorld) Into a more realistic P2P file-sharing / query scenario (FileWorld) Adapted to show that same technique can support cooperative specialization (SkillWorld)

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 Basic Tag idea in Networks The basic idea behind Tags is that agents interact within subpopulations (groups, cliques, niches, tribes or whatever) But, agents can compare their utility in some way with agents in other tribes and move to them if they appear to be doing better also copying better agents behavior in some way The “tag” is just the identifier that indicates which tribe the agent is in. Hence agents sharing the same tag inhabit the same tribe and hence interact (rather than interacting randomly or directly with other tribes) When translated into P2P overlay networks the tag becomes simply the neighbour list or view – because nodes sharing the same neighbour lists form a cluster of interaction Recent thought: This kind of thing can be compared to “adhesion” mechanisms in Biology

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 Basic Tag Idea in Networks If you let nodes in a network try to optimise their individual utility by copying the views and behaviours of other randomly chosen nodes (with a little mutation) from the network with higher utility then… Counter intuitive things happen…. In a range of scenarios, high levels of cooperation and altruistic like social behaviours and structures emerge But why? Since the copying and mutation process is analogus to replication in evolution, a kind of evolutionary process occurs This process favours cooperative tribes (since nodes in poorly performing tribes will tend to move away) A kind of weak “cultural group selective” process

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 Outline of the SLAC protocol (W=1)

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 SLAC and SLACER Selfish Link Adaptation for Cooperation (SLAC) Used in the previous scenarios (NetWorld, FileWorld, SkillWorld) But produced disconnected components (okay for these scenarios) To get a fully connected network – overlapping cooperative clusters or tribes… Selfish Link Adaptation for Cooperation Excluding Rewiring SLACER is just SLAC but with W=0.9 (or some value < 1) Marginally less cooperation (98-99% not % of nodes) Creates a kind of “Artificial Social Network” – small worldish (high C and low L compared to random) But different from real social networks…. Recently been looking at “Connected Cooperative Clusters” (CCC’s) – the number of CCC’s >= number of components This seems like a useful measure for some possible tasks

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 Problems and possible solutions Random sampling of the network – solution = NEWSCAST (Jelasity et al) already tested in simulation and works well Why should a node transmit the correct Utility, Strategy, Links? Cleaver Greedy Cheating Liars (CGCL’s) – interestingly, it is in the objective interests of CGCL’s to support cooperation – some experiments, net can tolerate quite a lot of CGCL’s Nasty Nihilists Nodes (N3’s) – could destroy cooperation – experiments pending. More general solution – move to a Satisfying model and drop utility comparisons, could be fruitful since each node could have it’s own “preferred service level” This could make the technique less general however…

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 CCC’s in SLAC and SLACER

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 CCC’s in SLAC and SLACER

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 CCC’s in SLAC and SLACER

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 In the context of SP6 Develop further the “saticficing” approach…? Find a good SP6 relevant specific scenario: Stopping query flooding? Stopping Malicious content, non-cooperative node behaviors? Encouraging overlay topology to evolve in a useful way? Clustering (forming tribes) around semantic interests? Encouraging altruistic node behaviors – storing data and processing queries when producing little? Exploiting existing altruistic nodes topologically? IDEAS? >

David Hales & Ozalp Babaoglu (UniBO) Data Management, Search, and Mining on Internet-Scale Dynamically Evolving P2P Networks Subproject 6 Thanks! Fini. PS. A lot of the detail of the discussed models will be presented at the Paris Complex Systems Workshop The SkillWorld will be presented at the ESOA Workshop located with AAMAS2005 in Utrecht next week. Get all papers at