Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Causal architecture, complexity and self-organization in time series and cellular automata
Causal architecture, complexity and self-organization in time series and cellular automata
Blind construction of optimal nonlinear recursive predictors for discrete sequences
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Queueing Networks and Markov Chains
Queueing Networks and Markov Chains
Incentives in BitTorrent induce free riding
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
IEEE/ACM Transactions on Networking (TON)
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Self-Organizing Networked Systems for Technical Applications: A Discussion on Open Issues
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
A Survey of Models and Design Methods for Self-organizing Networked Systems
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
The Degree of Global-State Awareness in Self-Organizing Systems
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
| Hi-index | 0.00 |
To achieve a preferred global behavior of self-organizing systems, suitable local interaction strategies have to be found. In general, this is a non-trivial task. In this paper, a general method is proposed that allows to systematically derive local interaction strategies by specifying the preferred global behavior. In addition, the resulting strategies can be evaluated using Markovian analysis. Then, by applying the proposed method exemplarily to the iterated prisoner's dilemma, we are able to systematically generate a cooperation-fostering strategy which can be shown to behave similar to the "tit for tat with forgiveness" strategy that, under certain circumstances, outperforms the well-known "tit for tat" strategy used, for instance, in BitTorrent peer-to-peer file-sharing networks.