A method to derive local interaction strategies for improving cooperation in self-organizing systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5343 LNCS, Issue , 2008, Pages 170-181

  Auer, Christopher ^a   Wüchner, Patrick ^a   De Meer, Hermann ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BIT TORRENTS; GENERAL METHOD; GLOBAL BEHAVIORS; ITERATED PRISONER'S DILEMMA; LOCAL INTERACTIONS; NON-TRIVIAL TASKS; PEER-TO-PEER FILE SHARING NETWORKS; SELF-ORGANIZING SYSTEMS;

PEER TO PEER NETWORKS;

EID: 58349083700     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92157-8_15     Document Type: Conference Paper

References (19)

1. Caro, G.D., Dorigo, M.: AntNet: a mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Université Libre de Bruxelles, Belgium
2. Cohen, B.: Incentives build robustness in BitTorrent (2003)
3. Jiang, J., Bai, H., Wang, W.: Trust and cooperation in peer-to-peer systems. In: Li, M., Sun, X.-H., Deng, Q.-n., Ni, J. (eds.) GCC 2003. LNCS, vol. 3032, pp. 371-378. Springer, Heidelberg (2004)
4. Lai, K., Feldman, M., Stoica, Chuang, J.: Incentives for cooperation in peer-to-peer networks. In: Workshop on Economics of Peer-to-Peer Systems (2003)
5. Jun, S., Ahamad, M.: Incentives in BitTorrent induce free riding. In: P2PECON 2005: Proceeding of the 2005 ACM SIGCOMM workshop on Economics of peerto-peer systems, pp. 116-121. ACM Press, New York (2005)
6. Axelrod, R.: The Evolution of Cooperation. Basic Books, Inc., Publishers, New York (1984)
7. Yew Chong, S., Humble, J., Kendall, G., Li, M., Yao, X.: The Iterated Prisoner's Dilemma: 20 Years On. In: The Iterated Prisoner's Dilemma: 20 Years On. World Scientific, Singapore (2006)
8. Shalizi, C.R.: Causal Architecture, Complexity and Self-Organization in Time Series and Cellular Automata. PhD thesis, University of Wisconsin, Supervisor: Martin Olsson (2001)
9. Shalizi, C.R., Shalizi, K.L.: Blind construction of optimal nonlinear recursive predictors for discrete sequences. In: AUAI 2004: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, Arlington, Virginia, United States, pp. 504-511. AUAI Press (2004)
10. Perkins, C., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: ACM SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, pp. 234-244 (1994)
11. Clausen, T., Jacquet, P.: Optimized link state routing protocol, OLSR (2003)
12. Diamantopoulos, F., Economides, A.A.: A performance study of DSDV-based CLUSTERPOW and DSDV routing algorithms for sensor network applications. In: ISWPC 2006: Proceedings of the 1st Internation Symposium on Wireless Pervasive Computing, pp. 1-6. IEEE Press, Los Alamitos (2006)
13. Eugster, P.T., Guerraoui, R., Kermarrec, A.M., Massoulieacute, L.: Epidemic information dissemination in distributed systems. Computer 37(5), 60-67 (2004)
14. Jelasity, M., Babaoglu, O.: T-Man: Gossip-based overlay topology management. In: Brueckner, S.A., Di Marzo Serugendo, G., Hales, D., Zambonelli, F. (eds.) ESOA 2005. LNCS, vol. 3910. Springer, Heidelberg (2006)
15. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: ICS 2002: Proceedings of the 16th International Conference on Supercomputing, pp. 84-95. ACM, New York (2002)
16. Haas, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad hoc routing. IEEE/ACM Trans. Netw. 14(3), 479-491 (2006)
17. Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (1994)
18. Bolch, G., Greiner, S., de Meer, H., Trivedi, K.S.: Queueing Networks and Markov Chains, 2nd edn. John Wiley & Sons, Inc., Hoboken (2006)
19. Rapoport, A., Cammah, A.M.: Prisoner's Dilemma: A Study in Conflict and Cooperation. University of Michigan Press (1965)