• Corpus ID: 7537278

Tag-Based Cooperation in Peer-to-Peer Networks with Newscast

@inproceedings{Marcozzi2005TagBasedCI,
  title={Tag-Based Cooperation in Peer-to-Peer Networks with Newscast},
  author={Andrea Marcozzi and David Hales and Gian Paolo Jesi and Stefano Arteconi and {\"O}zalp Babaoglu},
  booktitle={SOAS},
  year={2005}
}
Recent work has proposed how socially inspired mechanisms, based on “tags” and developed within social science simulations, might be applied in peer-to-peer overlay networks to maintain high cooperation between peers even when they act selfishly. The proposed mechanism involves a dynamic re-wiring algorithm called “SLAC”. The algorithm assumes a random sampling service over the entire population of nodes but does not implement this itself. In this paper we re-implement SLAC on an open source… 

Figures and Tables from this paper

Emergent Social Rationality in a Peer-to-Peer System
TLDR
It was found that for both model variants altruistic behavior was selected when certain cost/benefit constraints were met, and Interestingly, the SkillWorld model evidences a kind of superaltruism in which nodes are prepared to cooperate even when the cost is higher than the benefit.
Greedy Cheating Liars and the Fools Who Believe Them
TLDR
It is observed that in the first case, a certain percentage of such "greedy cheating liars" can actually improve certain performance measures, and in the second case, the network can maintain reasonable levels of cooperation even in the presence of a limited number of nihilist nodes.
Neighbourhood Maps: Decentralised Ranking in Small-World P2P Networks
TLDR
This work proposes a simple, scalable and decentralised method, called “neighbourhood maps”, that approximates rankings calculated using link-analysis techniques, exploiting the short-distance characteristics of small-world networks.
Neighbourhood maps: decentralised ranking in small-world P2P networks
  • Matteo Dell'Amico
  • Computer Science
    Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
  • 2006
TLDR
This work proposes a simple, scalable and decentralised method, called "neighbourhood maps", that approximates rankings calculated using link-analysis techniques, exploiting the short-distance characteristics of small-world networks.
Towards Cooperative, Self-Organised Replica Management
TLDR
This work presents a simple node level protocol that self-organises nodes into cooperative clusters leading to efficient outcomes in some simple scenarios and is scalable, robust and self- Organising but there are several open issues.
Tag-based Improved Search in Peer-to-Peer Overlays
TLDR
An improvised search is proposed in distributed P2P content sharing systems which make use of the external metadata assigned to the content by the public which is implemented on JXTA overlay for its interoperability and tested.
Efficient and Robust Fully Distributed Power Method with an Application to Link Analysis
TLDR
This paper introduces a fully distributed method, inspired by the power method, for the calculation of the principal eigenvector of generic matrices, focusing on link analysis as an application, and represents an important step towards a flexible, cheap and fully peer-to-peer search method in networks of hyperlinked documents.
Self-emerging coordination mechanisms for knowledge integration processes
TLDR
This work uses a computer simulation approach and investigates how local interaction of agents, endowed with skills and individual decision-making rules, may produce aggregate network structure able to perform tasks, and finds that self-organization depends on the structural features of formal or informal, organizational networks.
Self-Organizing Mechanisms for Task Allocation in a Knowledge-Based Economy
TLDR
The aim of this thesis is to bridge studies from computer science and in particular from Peer-to-Peer Networks (P2P) to organization theories and believe that P2P Networks show a number of characteristics similar to firms working in a knowledge-based economy and hence that the methodology used for studying P2Ps can be applied to organization studies.
CoopNet: A Social, P2P-Like Simulation Model to Explore Knowledge-Based Production Processes
A prevalent claim is that we are in a knowledge economy, where firms can be viewed as networks of knowledge nodes interacting together.

References

SHOWING 1-10 OF 49 REFERENCES
Applying a socially inspired technique (tags) to improve cooperation in P2P networks
  • David HalesB. Edmonds
  • Computer Science
    IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
  • 2005
TLDR
A simple algorithm is proposed that maintains high levels of cooperation in peer-to-peer networks of selfish adaptive peers while performing the collective task of file sharing and is demonstrated to be scalable, robust, and decentralized.
From selfish nodes to cooperative networks - emergent link-based incentives in peer-to-peer networks
  • David Hales
  • Computer Science
    Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings.
  • 2004
TLDR
This work presents initial results from simulations of an algorithm allowing nodes to adapt selfishly yet maintaining high levels of cooperation in both a Prisoners' dilemma and a flood-fill query scenario and appears to emerge its own incentive structure.
Self-Organising, Open and Cooperative P2P Societies - From Tags to Networks
  • David Hales
  • Computer Science
    Engineering Self-Organising Systems
  • 2004
TLDR
It is found that a simple node rewiring policy, based on the tag dynamics, quickly eliminates free-riding without centralized control and the process appears highly scalable and robust.
Epidemic-style proactive aggregation in large overlay networks
  • M. JelasityA. Montresor
  • Computer Science
    24th International Conference on Distributed Computing Systems, 2004. Proceedings.
  • 2004
TLDR
The proposed antientropy aggregation protocols compute different aggregates of component properties like extremal values, average and counting, which make them suitable for implementing e.g. collective decision making or automatic system maintenance based on global information in a fully distributed fashion.
How to cheat BitTorrent and why nobody does
TLDR
A hypothesis is advanced which argues that BitTorrent may resist free-riders in a way that has not been previously fully comprehended and that, given the choice, users may choose unconditional altruism rather than the more restrictive reciprocal tit-for-tat approach as a result of the same group selective process.
Evolution of cooperation without reciprocity
TLDR
Computer simulations are used to show that cooperation can arise when agents donate to others who are sufficiently similar to themselves in some arbitrary characteristic, or ‘tag’, which can be a marking, display, or other observable trait.
Advanced Collective Communication in WDM Optical Rings.
TLDR
It is proved that Internal-All-to-All instances can be efficiently and optimally routed and colored and an approximation algorithm which uses a number of colors that is at most 53 times the network congestion of the ring, where thenetwork congestion is a lower bound on the optimal solution.
Multi-Agent-Based Simulation
TLDR
The issue addressed in the MABS-2000 workshop and in this volume is the development of a methodology and technology to identify which techniques hold promise and which cannot possibly lead to useful applications for messy software or social systems.
Change Your Tags Fast! - A Necessary Condition for Cooperation?
TLDR
It appears that, in general, for tag-based systems to support high levels of cooperation tags must mutate faster than strategies because cooperative tag groups need to spread before free riders invade the group.
Fault Tolerant Knowledge Level Communication in Open Asynchronous Multi-Agent Systems
TLDR
The Fault Tolerant Agent Communication Language is presented, which provides high-level fault tolerant communication primitives and support for an anonymous interaction protocol which satisfy a set of well defined knowledge level programming requirements.
...
...