• Publications
  • Influence
Motifs in evolving cooperative networks look like protein structure networks
TLDR
We present results from a motif analysis of networks produced by peer-to-peer protocols that support cooperation between evolving nodes. Expand
  • 30
  • 1
  • PDF
SLACER: a self-organizing protocol for coordination in peer-to-peer networks
TLDR
Coordination between nodes in open distributed computer systems is a general problem that's becoming increasingly relevant as massive peer-to-peer (P2P) systems are being deployed on the Internet. Expand
  • 87
  • PDF
Greedy Cheating Liars and the Fools Who Believe Them
TLDR
Evolutionary algorithms based on "tags" can be adapted to induce cooperation in selfish environments such as peer-to-peer systems. Expand
  • 19
  • PDF
Friends for Free: Self-Organizing Artificial Social Networks for Trust and Cooperation
TLDR
We propose an algorithm (SLACER) that allows peer nodes to create and manage their own friendship networks, tuned, in real time, directly for specific applications. Expand
  • 14
  • PDF
SLACER: randomness to cooperation in peer-to-peer networks
Peer-to-peer applications can benefit from human friendship networks (e.g., e-mail contacts or instant message buddy lists). However these are not always available. We propose an algorithm, calledExpand
  • 11
  • PDF
Evolving networks for social optima in the “weakest link game”
TLDR
We apply a simple “copy and rewire” algorithm to a more tricky co-ordination game (the weakest link) requiring interactions from several players (nodes) that may play several strategies. Expand
  • 7
  • PDF
Tag-Based Cooperation in Peer-to-Peer Networks with Newscast
TLDR
In this paper we re-implement SLAC on an open source peer-to-peer simulation testbed called “PEERSIM”. Expand
  • 10
  • PDF
Towards a Group Selection Design Pattern
TLDR
We proposed a general mechanism based on an evolutionary “group selection” process in which individual entities (agents, nodes or components) dynamically copy the behavior of other entities if they achieve higher performance. Expand
  • 10
  • PDF
Basic algorithm
see the bus be empty for two times the maximum propagation time plus the minimum length of time needed to detect a packet plus the minimum space between packets. This makes an empty slot always costExpand
  • 4
  • PDF
Broadcasting at the Critical Threshold in Peer-to-Peer Networks 1
Peer-to-peer (P2P) applications often require periodic broadcasting of messages from a single node to the entire network. For example, a node may wish to inform the network the availability of a newExpand
  • 3
  • PDF
...
1
2
...