Peer to peer: Peering into the future

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

Volumn 2497, Issue , 2002, Pages 1-19

  Crowcroft, Jon ^a   Pratt, Ian ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957879948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36162-6_1     Document Type: Conference Paper

References (48)

1. Napster. “The Technology Behind Napster”, copy of this is cached at: http://gaia.cs.umass.edu/cs591/hwpa/napster.htm
2. The Gnutella Protocol, version 0.4, http://www.clip2.com/GnutellaProtocol04.pdf
3. “Freenet: A Distributed Anonymous Information Storage and Retrieval System”, I. Clarke, B. Wiley, O. Sanberg, T. Hong, in Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, Springer-Verlag LNCS 2009, ed. by H. Federrat, Springer: New York (2001). http://freenet.sourceforge.net/index.php?page=icsi-revised
4. “Sun’s Project JXTA: A Technology Overview”, L. Gong, http://www.jxta.org/project/www/docs/TechOverview.pdf
5. “Morpheus out of the Underworld”, K. Truelove, A. Chasin, http://www.openp2p.com/pub/a/p2p/2001/07/02/morpheus.html?page=1
6. “The Case for Reslient Overlay Networks”, D. Anderson, H. Balakrishnan, F. Kaashoek, R. Morris, Proc. HotOS VIII, May 2001, http://nms.lcs.mit.edu/papers/ron-hotos2001.html
7. “A Case For End System Multicast”, Y. Chu, S. Rao, H. Zhang, Proceedings of ACM SIGMETRICS, Santa Clara, CA, June 2000, pp 1-12. http://www.cs.cmu.edu/afs/cs/project/cmcl-yhchu/www/Sigmetrics2000/sigmetrics-2000.ps.gz
8. “Enabling Conferencing Applications on the Internet Using an Overlay Multicast Architecture”, Y. Chu, S. Rao, S. Seshan, H. Zhang, Proc. ACM Sigcomm 2001, http://www.acm.org/sigs/sigcomm/sigcomm2001/p5-chu.pdf
9. “Overcast: Reliable Multicasting with an Overlay Network”, J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. W. O’Toole, Jr., Proceedings of OSDI’00. http://gaia.cs.umass.edu/cs791n/Jannotti00.pdf
10. “Tapestry: A Fault Tolerant Wide Area Network Infrastructure”, B. Zhou, D. A. Joseph, J. Kubiatowicz, Sigcomm 2001 poster and UC Berkeley Tech. Report UCB/CSD-01-1141. http://www.cs.berkeley.edu/˜ravenben/publications/CSD-01-1141.pdf
11. “Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications”, I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan, ACM Sigcomm 2001, http://www.acm.org/sigcomm/sigcomm2001/p12.html
12. “A Scalable Content-Addressable Network”, S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, ACM Sigcomm 2001, http://www.acm.org/sigcomm/sigcomm2001/p13.html
13. “Application-level Multicast using Content-Addressable Networks”, Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker In Proceedings of NGC 2001 http://www.icir.org/sylvia/can-mcast.ps
14. “Application-Level Anycasting: a Server Selection Architecture and Use in a Replicated Web Service”, E. Zegura, M. Ammar, Z. Fei, and S. Bhattacharjee. IEEE/ACM Transactions on Networking, Aug. 2000. ftp://ftp.cs.umd.edu/pub/bobby/publications/anycast-ToN-2000.ps.gz
15. “Evaluation of a Novel Two-Step Server Selection Metric”, K. M. Hanna, N. Natarajan, and B.N. Levine, in IEEE ICNP 2001. http://www.cs.umass.edu/˜hanna/papers/icnp01.ps
16. “Fault Tolerant Replication Management in Large Scale Distributed Storage Systems”, R. Golding, E. Borowski, 1999 Symposuium on Reliable Distributed Systems, http://gaia.cs.umass.edu/cs791n/peters paper.pdf
17. “Xenoservers: Accounted Execution of Untrusted Code”, D. Reed, I. Pratt, P. Menage, S. Early, N. Stratford, Proceedings, 7th Workshop on Hot Topics in Operating Systems HotOS 1999 http://www.cl.cam.ac.uk/Research/SRG/netos/xeno/
18. “OceanStore: An Architecture for Global-Scale Persistent Storage”, J. Kubiatowicz, et al., in Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000. http://oceanstore.cs.berkeley.edu/publications/papers/pdf/asplos00.pdf
19. “A Measurement Study of Napster and Gnutella as Examples of Peer-Peer File Sharing Systems”, P. Gummagi, S Sariou, S. Gribble, ACM Sigcomm 2001 poster.
20. “Free Riding on Gnutella”, E. Adar, and B. Huberman, First Monday, Vol. 5, No. 10, http://www.firstmonday.dk/issues/issue510/adar/
21. “Search in Power-Law Networks”, L. Adamic, A. Lukose, R. Lukose, and B. Huberman, http://www.hpl.hp.com/shl/papers/plsearch/
22. “SCRIBE: The Design of a Large-scale Event Notification Infrastructure”, A. Rowstron, A-M. Kermarrec, P. Druschel and M. Castro, Submitted June 2001. http://www.research.microsoft.com/˜antr/PAST/scribe.pdf
23. “Security Aspects of Napster and Gnutella”, S. Bellovin, Distinguished lecture at Polytechnic U., Real-Audio presentation (1 hour). http://media.poly.edu/RealMedia/electrical/eesem10 26.ram.Slides available at http://www.research.att.com/˜smb/talks/NapsterGnutella.
24. “Publius: A Robust, Tamper-evident, Censorship-resistant, Web Publishing System”, MarcWaldman, Aviel D. Rubin and Lorrie Faith Cranor, Proc. 9th USENIX Security Symposium, pp 59-72, August 2000. http://publius.cdt.org/publius.pdf
25. “Crowds: Anonymity forWeb Transactions”, M. Reiter and A. Rubin, ACM Transactions on Information and System Security, November 1998
26. “Responder Anonymity and Anonymous Peer-to-Peer file sharing”, V. Scarlata, B.N. Levine, and C. Sheilds, ICNP 2001. http://signl.cs.umass.edu/pubs/scarlata.apfs.ps.gz
27. “The Small-World Phenomenon: An Algorithmic Perspective”, Jon Kleinberg, http://www.cs.cornell.edu/home/kleinber/swn.ps
28. “Streaming Live Media over a Peer-to-Peer Network”, H. Deshpande, M. Bawa, H. Garcia-Molina, http://dbpubs.stanford.edu:8090/pub/2001-31
29. “Storage Management and Caching in PAST, A Large-scale, Persistent Peer-topeer Storage Utility”, A. Rowstron, P. Druschel, SOSP 2001. http://www-cse.ucsd.edu/sosp01/papers/rowstron.pdf
30. “Routing in Overlay Multicast Networks”, S. Shi and J. Turner, Technical Report, TR 01-19, Washington University, http://www.arl.wustl.edu/arl/Publications/2000-04/wucs0119.pdf
31. “What Can Peer-to-Peer Do for Databases, and Vice Versa?”, S. Gribble, A. Halevy, Z. Ives, M. Rodrig, D. Suciu, in The Fourth International Workshop on the Web and Databases (WebDB’2001). http://www.cs.washington.edu/homes/gribble/papers/p2p.ps.gz
32. “A peer-to-peer VOIP network”, http://phonebazooka.com/
33. “Resilient Overlay Networks”, D. Anderson, H. Balakrishnan, F. Kaashoek, R. Morris, Proc. 18th ACM SOSP, Banff, Canada, October 2001. http://nms.lcs.mit.edu/papers/ron-sosp2001.html
34. “Using the Small World Model to Improve Freenet Performance”, H. Zhang, A. Goel, R. Givindran, Proceedings of IEEE Infocom, June 2002.
35. “Peer-to-Peer Architecture Case Study: Gnutella”, M. Ripeanu, in Proceedings of 2001 International conference on P2P computing http://people.cs.uchicago.edu/˜matei/PAPERS/P2P2001.pdf
36. “Determining Characteristics of the Gnutella Network”, B. Gedik, http://www.cs.gatech.edu/people/home/bgedik/mini-projects/mini-project1/FinalReport.htmq
37. Limewire tech papers, http://www.limewire.com/index.jsp/techpapers
38. Industry viewpoint: http://www.openp2p.com/andhttp://conferences.oreilly.com/p2p/
39. “Peer-to-peer, Harnessing the Power of Disruptive Technologies”, Edited by Andy Oram, pub. O’Reilly, Mar 2001, ISBN 0-596-00110
40. “Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peerto- Peer Systems” A. Rowstron and P. Druschel, IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pages 329-350, November, 2001.
41. “Exploiting Network Proximity in Peer-to-Peer Overlay Networks”, M. Castro, P. Druschel, Y. C. Hu, A. Rowstron, http://www.research.microsoft.com/˜antr/Pastry/pubs.htm, submitted for publication.
42. “Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs”, William J. Bolosky, John R. Douceur, David Ely, and Marvin Theimer http://research.microsoft.com/sn/farsite/ACM SIGMETRICS 2000.
43. “Grapevine: An Exercise in Distributed Computing”, Andrew D. Birrell, Roy Levin, Roger M. Needham and Michael D. Schroeder, Communications ACM, vol. 25, no. 4, pp. 260–274, Apr. 1982.
44. “Experience with Grapevine: The Growth of a Distributed System”, Michael D. Schroeder, Andrew D. Birrell and Roger M. Needham, ACM Transactions on Computer Systems, vol. 2, no. 1, pp. 3–23, Feb. 1984.
45. “The Eternity Service”, R. J. Anderson. In Proceedings of Pragocrypt 96, 1996
46. “The Magna Carta” http://www.nara.gov/exhall/charters/magnacarta/magmain.html
47. “Middle Box Taxonomy” Brian Carpenter, and Scott Brim, April 2001. Work in progress.
48. “Looking Over the Fence at Networks: A Neighbor’s View of Networking Research” Committee on Research Horizons in Networking, Computer Science and Telecommunications Board, National Research Council, USA http://www.nap.edu/books/0309076137/html/