[1] I. Stoica, R. Morris, D. Karger, M. Frans Kaashoek, H. Balakrishnan : Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. SIGCOMM 2001: 149-160 (pdf) . Also see the the tech report
[2] David Karger et al. Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web (pdf) . A simpler version is available here
[3] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, S. Shenker : Making Gnutella-like P2P Systems Scalable. In Proceedings of ACM SIGCOMM 2003, Karlsruhe, Germany, August 2003 (pdf)
[4] Ian Clarke, Oskar Sandberg, Brandon Wiley, Theodore W. Hong : Freenet: A Distributed Anonymous Information Storage and Retrieval System. LNCS 2009, pp. 46-66, 2001 (pdf)
[5] C. G. Plaxton, R. Rajaraman, A.W. Richa : Accessing nearby copies of replicated objects in a distributed environment. In Theory of Computing Systems 32:241-280, 199a (pdf)
[6] Antony Rowstron, Peter Druschel : Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. Middleware'2001, Germany, November 2001 (pdf)
[7] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard M. Karp, Scott Shenker: A scalable content-addressable network. SIGCOMM 2001: 161-172. )(pdf)
[8] Duncan J. Watts, Steven H. Strogatz : Collective dynamics of small-world networks. Nature 393:440-42 (pdf)
[9] Jon Kleinberg: The small-world phenomenon: An algorithmic perspective, Proc. 32nd ACM Symposium on Theory of Computing, 2000 (pdf)
[10] James Aspnes, Gauri Shah : Skip Graphs. SODA 2003: 384-393
(pdf) (pdf)
[11] Peter Triantafillou, Ioannis Aekaterinidis : Content-based Publish-Subscribe Over Structured P2P Networks. 1st International Workshop on Discrete Event-Based Systems, 2004 (pdf)
[12] Jie Wu, Zhihui lu, Bisheng Liu, Shiyong Zhang: PeerCDN: A novel P2P network assisted streaming content delivery network scheme. (pdf)
[14] J.A. Pouwelse, P. Garbacki, D.H.J. Epema, H.J. Sips : The Bittorent P2P File-Sharing System: Measurements and Analysis. 4th International Workshop on Peer-to-Peer Systems (IPTPS'05), 2005 (pdf)
[15] Ashwin R. Bharambe, Cormac Herley : Analyzing and Improving BitTorrent Performance. Technical Report MSR-TR-2005-03 (pdf)
[16] Moni Naor, Udi Wieder: Know thy Neighbor’s Neighbor: Better Routing for Skip-Graphs and Small Worlds. IPTPS 2004: 269-277 (pdf)
[17] Zhihui Lu, Ye Wang, Yang R. Yang: an Analysis and Comparison of CDN-P2P-hybrid Content Delivery System and Model. Journal of Communications 7 (3), pp. 232-245, March 2012. (pdf)
[18] Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker : Search and Replication in Unstructured Peer-to-Peer Networks. SIGMETRICS 2002: 258-259 (pdf)
[19] M. Frans Kaashoek and David R. Karger : Koorde: A simple degree-optimal distributed hash table. IPTPS 2003: 98-107 (pdf)
[20] S.A.Baset and H.G. Schulzrine: An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol. Infocom 2006 (pdf) (also read http://www.explainthatstuff.com/how-voip-works.html)
[21] K.P. Gummadi et al.: Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload (pdf)
[22] Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph, and John Kubiatowicz: Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications, January 2004, Vol. 22, No. (pdf) 1
[23] A. Singh, T. W. Ngan, P. Druschel, and D. S. Wallach. Eclipse attacks on overlay networks: Threats and defenses. In Proc. INFOCOM 2006, Barcelona, Spain (pdf)
[24] John Douceur: The Sybil Attack. IPTPS 2003 (pdf)
[25] Gurmeet Singh Manku, Mayank Bawa, Prabhakar Raghavan: Symphony: Distributed Hashing in a Small World (pdf)
[26] Fabrikant, Luthra, Maneva, Papadimitriou, Shenker: On a Network Creation Game. ACM PODC 2003 (pdf)
[27] Petar Maymounkov, David Mazières: Kademlia: A Peer-to-peer Information System Based on the XOR Metric IPTPS'02 March 2002. (pdf)
[28] Fabian Kuhn, Stefan Schmid, Roger Wattenhofer: A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn. Springer (LNCS 3640), 2005. (pdf)
[29] C. G. Plaxton, R. Rajaraman, A.W. Richa : Accessing nearby copies of replicated objects in a distributed environment. In Theory of Computing Systems 32:241-280, 1999 (pdf)
[30] Pan Hui, Jon Crowcroft, Eiko Yoneki: BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks. IEEE Trans. Mob. Comput. 10(11): 1576-1589 (2011) (pdf)
[31] Avinash Lakshman, Prashant Malik: Cassandra: a structured storage system on a P2P network. SPAA 2009: 47 (pdf)
[32] Mark S. Granovetter: The Strength of Weak Ties. American Journal of Sociology, Volume 78, Issue 6 (May, 1973), 1360-1380. (pdf)
[33] Sergio Marti, Prasanna Ganesan, Hector Garcia-Molina : DHT Routing Using Social Links. IPTPS 2004: 100-111 (pdf)
[34] Benjamin Frank et al.: Pushing CDN-ISP Collaboration to the Limit. ACM SIGCOMM 2013 pp. 35-44 (pdf)
[35] Ramesh Sitaraman et al. Overlay Networks: An Akamai Perspective (pdf)
[36] J. Leskovec, D. Huttenlocher, J. Kleinberg. Predicting Positive and Negative Links in Online Social Networks. In Proc. WWW, 2010. (pdf)
[37] Satoshi Nakamoto: Bitcoin: A Peer-to-Peer Electronic Cash System. (pdf) 2008.
[38] Adam Back: "Hashcash - a denial of service counter-measure. (pdf) 2002
[39] Shai Rubin: What is BItCoin? (YouTube video)
[40] Bruce M. Maggs, Ramesh K. Sitaraman: Algorithmic Nuggets in Content Delivery. (not peer-reviewed, it is an editorial note submitted to CCR). (pdf>
[41] Lars Backstrom, Jure Leskovec: Sueprvised random Walks: Predicting and Recommending Links in Social Networks. (pdf)
[42] Guy Zyskind, Oz Natha, Sandy Pentland: Decentralizing Privacy: Using Blockchain to Protect Personal Data. IEEE CS Security and Privacy Workshop 2015. (pdf)