CS:4980:0005 Peer-to-peer and Social Networks
Tentative Readings List

[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 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
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

[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

[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, 1999

[6] Antony Rowstron, Peter Druschel : Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. Middleware'2001, Germany, November 2001

[7] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard M. Karp, Scott Shenker: A scalable content-addressable network. SIGCOMM 2001: 161-172

[8] Duncan J. Watts, Steven H. Strogatz : Collective dynamics of small-world networks. Nature 393:440-42

[9] Jon Kleinberg: The small-world phenomenon: An algorithmic perspective, Proc. 32nd ACM Symposium on Theory of Computing, 2000

[10] Hui Zhang, Ashish Goel, Ramesh Govindan : Using the Small-World Model to Improve Freenet Performance. INFOCOM 2002

[11] Sergio Marti, Prasanna Ganesan, Hector Garcia-Molina : DHT Routing Using Social Links. IPTPS 2004: 100-111

[12] James Aspnes, Gauri Shah : Skip Graphs. SODA 2003: 384-393

[13] Peter Triantafillou, Ioannis Aekaterinidis : Content-based Publish-Subscribe Over Structured P2P Networks. 1st International Workshop on Discrete Event-Based Systems, 2004

[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

[15] Ashwin R. Bharambe, Cormac Herley : Analyzing and Improving BitTorrent Performance. Technical Report MSR-TR-2005-03

[16] Moni Naor, Udi Wieder: Know thy Neighbor’s Neighbor: Better Routing for Skip-Graphs and Small Worlds. IPTPS 2004: 269-277

[17] D. Malkhi, M. Naor, D. Ratajczak : Viceroy: a scalable and dynamic emulation of the butterfly. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC '02)

[18] Edith Cohen, Scott Shenker : Replication Strategies in Unstructured Peer-to-Peer Networks. SIGCOMM 2002: 177-190

[19] Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker : Search and Replication in Unstructured Peer-to-Peer Networks. SIGMETRICS 2002: 258-259

[20] M. Zaharia and S. Keshav : Gossip-based Search Selection in Hybrid Peer-to-Peer Networks. Proc. IPTPS, February 2006

[21] Bin Yu, Munindar P. Singh : Searching Social Networks. AAMAS 2003: 65-72

[22] M. Frans Kaashoek and David R. Karger : Koorde: A simple degree-optimal distributed hash table. IPTPS 2003: 98-107

[23] Amos Fiat and Jared Saia: Censorship Resistant Peer-to-Peer Content Addressable NetworksSODA 2002

[24] S. Guha, Neil Daswani, and Ravi Jain: An Experimental Study of the Skype Peer-to-Peer VoIP System

[24a] S.A.Baset and H.G. Schulzrine: An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol. Infocom 2006

[25] K.P. Gummadi et al.: Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload

[26] Tapestry: A Resilient Global-scale Overlay for Service Deployment Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph, and John Kubiatowicz: IEEE Journal on Selected Areas in Communications, January 2004, Vol. 22, No. 1

[27] 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

[28] John Douceur: The Sybil Attack. IPTPS 2003

[29] OceanStore: An Architecture for Global-Scale Persistent Storage: John Kubiatowicz, Davic Bindel, Yan Chen, Steven Czerwinski, Patrick Eaton, Dennis Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Westley Weimer, Chris Wells, Ben Zhao. Proceedings of ACM ASPLOS 2000.

[30] The Beehive System

[31] Karthik Tamilmani, Vinay Pai, Alexander E. Mohr: SWIFT: A System With Incentives For Trading (2004)

[32] Gurmeet Singh Manku, Mayank Bawa, Prabhakar Raghavan: Symphony: Distributed Hashing in a Small World

[33] Peter Biddle, Paul England, Marcus Peinado, and Bryan William: The Darknet and the Future of Content Distribution, Microsoft Corporation

[34] Fabrikant, Luthra, Maneva, Papadimitriou, Shenker: On a Network Creation Game. ACM PODC 2003

[35] Petar Maymounkov, David Mazières: Kademlia: A Peer-to-peer Information System Based on the XOR Metric IPTPS'02 March 2002.

[36] Fabian Kuhn, Stefan Schmid, Roger Wattenhofer: A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn. Springer (LNCS 3640), 2005.

[37] M. Castro, P. Druschel, A-M. Kermarrec and A. Rowstron, "SCRIBE: A large-scale and decentralised application-level multicast infrastructure", IEEE Journal on Selected Areas in Communications (JSAC) (Special issue on Network Support for Multicast Communications). 2002,

[38] Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz. Handling Churn in a DHT. Proceedings of the USENIX Annual Technical Conference, June 2004.

[39] Ian. Foster, Carl Kesselman, Steven Tuecke, ``Anatomy of a Grid''

[40] The Bamboo Distributed Hash Table: A Robust Open-source DHT

[41] 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

[42] Pan Hui, Jon Crowcroft, Eiko Yoneki: BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks. IEEE Trans. Mob. Comput. 10(11): 1576-1589 (2011)

[43] A. G. Miklas, K. K. Gollu, K. K. W. Chan, S. Saroiu, K. P. Gummadi, E. de Lara. Exploiting Social Interactions in Mobile Systems. Ubicomp 2007.

[44] Naveen Kumar Sharma, Saptarshi Ghosh, Fabrício Benevenuto, Niloy Ganguly, P. Krishna Gummadi: Inferring who-is-who in the Twitter social network. Computer Communication Review 42(4): 533-538 (2012)>

[45] Avinash Lakshman, Prashant Malik: Cassandra: a structured storage system on a P2P network. SPAA 2009: 47

[46] The Strength of Weak Ties. Mark S. Granovetter. American Journal of Sociology, Volume 78, Issue 6 (May, 1973), 1360-1380.

[47] Avinash Lakshman, Prashant Malik: Cassandra: a decentralized structured storage system. Operating Systems Review 44(2): 35-40 (2010)

[48] A.H. Payberah: CLive: Cloud-assisted P2P live streaming IEEE 12th International Conference on P2P Computing: 79-90

[49] Sergio Marti, Prasanna Ganesan, Hector Garcia-Molina : DHT Routing Using Social Links. IPTPS 2004: 100-111

[50] Alberto Blanc, Yi-Kai Liu, Amin Vahdat: Designing Incentives for P2P networks

[51] Benjamin Frank et al. Pushing CDN-ISP Collaboration to the Limit ACM SIGCOMM 2013 pp. 35-44

[52] Ramesh Sitaraman et al. Overlay Networks: An Akamai Perspective

[53] J. Leskovec, D. Huttenlocher, J. Kleinberg. Predicting Positive and Negative Links in Online Social Networks. In Proc. WWW, 2010.

[54] S. Myers, J. Leskovec. Clash of the Contagions: Cooperation and Competition in Information Diffusion. In Proc. ICDM#2012.

[55] D. Liben Nowell, J. Kleinberg. The Link Prediction Problem for Social Networks. Proc. CIKM, 2003 .

[56] M. Cha, A. Mislove, K. P. Gummadi. A measurement driven analysis of information propagation in the flickr social network. In Proc. WWW, 2008.

[57] Pons and Latapy. Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10(2): 191-218 (2006)