Liste mit einigen Literaturhinweisen
(unvollständig)

Allgemein

- Mahlmann, Schindelhauer: "Peer-to-Peer-Netzwerke", Buch, Springer, 2007.

- Boyd, Mathuria: "Protocols for Authentication and Key Establishment", Buch, Springer, 2003.

- Gerade im Bereich P2P liefert Wikipedia oft einen guten Einstieg. Die Suche nach andere Skripten, die das gleiche Problem anders erklären, kann auch hilfreich sein.

Kapitel 1

1.2

- Stanley Milgram: The Small World Problem. In: Psychology Today, Mai 1967, S. 60–67.


- Duncan J. Watts and Stephen H. Strogatz: Collective dynamics of ’small-world’ networks. Nature (1998), Juni, Nr. 393, S. 440–442.

- Albert-László Barabási and Réka Albert: Emergence of scaling in random networks. Science 286, 509–512 (1999).

- Judith S. Kleinfeld: Could It Be A Big World After All? The „Six Degrees of Separation“ Myth, Working Paper; Six Degrees: Urban Myth?, Psychology Today, 2001.

- Li, Alerderson, Tanaka, Doyle, Willinger: „Towards a Theory of Scale-Free Graphs“, 2005.

- Bram Cohen: Incentives build robustness in BitTorrent, 2003.

1.3

- Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan: "Chord: A scalable peer-to-peer lookup service for internet applications", Sigcomm 2001.

- Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker. "A scalable content-addressable network", Sigcomm 2001.

- Petar Maymounkov and David Mazieres: "Kademlia: A Peer-to-peer Information System Based on the XOR Metric", IPTPS 2002.
	
- Antony I. T. Rowstron , Peter Druschel. "Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems", Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, p.329-350, November 12-16, 2001. 	

1.4

- Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp, Ion Stoica: "Load Balancing in Structured P2P Systems", IPTPS 2003.

- David Karger, Mathias Ruhl: "Simple Efficient Load Balancing for Peer-to-Peer Systems", IPTPS 2004.

- Miguel Castro, Peter Druschel, Y.C. Hu, Anthony Rowstron: "Exploiting Network Proximity in Peer-to-Peer Netwokrs", Technical Report, Microsoft Research, 2002.

- Krishna P. Gummadi, Ramakrishna Gummadi, Steven D. Gribble, Sylvia Ratnasamy, Scott Shenker, and Ion Stoica: 2The Impact of DHT Routing Geometry on Resilience and Proximity", Proceedings of the ACM SIGCOMM 2003, Karlsruhe, Germany, August 2003.

Kapitel 2

2.1 

2.2 

- Emil Sit and Robert Morris: "Security Considerations for Peer-to-Peer Distributed Hash Tables", IPTPS 2002.	

- John R. Douceur, The Sybil Attack, Revised Papers from the First International Workshop on Peer-to-Peer Systems, p.251-260, March 07-08, 2002 

- G. Danezis, C. Lesniewski-Laas, M. F. Kaashoek, and R. Anderson. Sybil-resistant DHT routing. In European Symposium On Research In Computer Security, 2005.

- Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, Abraham Flaxman: "SybilGuard: Defending Against Sybil Attacks via Social Networks", Sigcomm 2006.
 
2.3

- http://freenetproject.org/papers.html

2.4
- Felix Lederer, Tillmann Werner: "Know your enemy: Containing Conficker", 2009,
 http://www.honeynet.org

- Honeynet Project: "Know your enemy: Fast Flux Service Networks", 2007,
 http://www.honeynet.org

- Jose Nazario, Thorsten Holz: "As the net churns: Fast-Flux
Botnet Observations", Malware 2008.

- Günther Starnberger, Christopher Kruegel, Engin Kirda: "Overbot - a botnet protocol based on Kademlia", Securecomm 2008.

Kapitel 3

3.1

3.2

3.3
- tor.eff.org

- jondos.de