Department of
Computer Science
and Engineering

Peer-to-Peer Storage Systems References

 Sun Murthy Home | P2P Storage Home

This is a cached copy. Go to http://www.cse.ogi.edu/~smurthy/p2ps/index.html for the current version.

 

Related links
- Name-Year System for references
- CBE Documentation
- Digital Object Identifiers (DOI)
- DOI home
- Handle system
- Handle System Proxy Server

See also
- Research summary
- Presentation
(Anderson 1996). Anderson R.J, 1996. The Eternity service. In: Proceedings of the 1st International Conference on the Theory and Applications of Cryptology (PRAGOCRYPT '96); 1996; Prague, Czech Republic.
(ANSI 1997). American National Standards Institute. 1997. American National Standard X9.30.2­1997: Public Key Cryptography for the Financial Services Industry ­ Part 2: The Secure Hash Algorithm (SHA­1) (1997).
FIPS version available online: <http://www.itl.nist.gov/fipspubs/fip180-1.htm> Accessed 2002 Jan. 27.
(Blaze 1993). Blaze M. 1993. A cryptographic file system for UNIX. In: Proceedings of ACM CCS Conference; 1993; November; Fairfax, Virginia; Pages 9-16.
Available online <http://doi.acm.org/10.1145/168588.168590> Accessed 2002 Jan. 28.
(Bloom 1970). Bloom B. 1970. Space/time trade­offs in hash coding with allowable errors. In: Communications of the ACM; Volume 13(7); 1970; July; Pages 422-426.
Available online <http://doi.acm.org/10.1145/362686.362692> Accessed 2002 Jan. 28.
(Bolosky 2000). Bolosky W.J, Douceur J.R, Ely D, Theimer M. 2000. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In: Proceedings of SIGMETRICS'2000; 2000. Santa Clara, CA; Pages 34-43.
Available online <http://dx.doi.org/10.1145/345063.339345>.
(Clarke 1999). Clarke I.1999. A distributed decentralised information storage and retrieval system. Unpublished report; Division of Informatics, University of Edinburgh; 1999.
Available online <http://freenetproject.org/freenet.pdf> Accessed 2002 Jan. 27.
(Clarke 2000). Clarke I, Sandberg O, Wiley B, Hong TW. 2000. Freenet: A distributed anonymous information storage and retrieval system. In: Proceedings of Workshop on Design Issues in Anonymity and Unobservability; 2000; July; ICSI, Berkeley, CA; Pages 311-320.
(Deering 1989). Deering S. 1989. Host Extensions for IP Multicasting. RFC­1112 IETF; SRI International; 1989; August; Menlo Park, CA
(Dingledine 2000). Dingledine R, Freedman M.J, Molnar D. 2000. The Free Haven project: Distributed anonymous storage service. In: Proceedings of Workshop on Design Issues in Anonymity and Unobservability; 2000; July; Berkeley, CA..
(Gnutella 2000). The Gnutella Protocol Specification v0.4. Clip2 Distributed Search Services. 2000.
Available online: <http://www.gnutella.co.uk/library/pdf/gnutella_protocol_0.4.pdf> Accessed 2002 Jan. 27.
(Hong 2001). Hong T. 2001. Performance. In: Peer­to­Peer. Ed. A. Oram. O'Reilly; 2001. Sebastopol, CA.
Pre-pub draft available online: <http://www.doc.ic.ac.uk/~twh1/longitude/papers/oreilly.pdf> Accessed 2002 Jan. 27.
(Kubiatowicz 2000). Kubiatowicz J, Bindel D, Chen Y, Czerwinski S, Eaton P, Geels D, Gummadi R, Rhea S,  Weatherspoon H, Weimer W, Wells C, Zhao B. 2000. OceanStore: An architecture for global­scale persistent store. In: Proceedings of ASPLOS'2000; 2000; November; Cambridge, MA; Pages 190-201.
Available online <http://dx.doi.org/10.1145/378995.379239>
(Lamport 1982). Lamport L, Shostak R, Pease M. 1982. The Byzantine generals problem. In: ACM TOPLAS; Volume 4(3); 1982; Pages 382-401.
Available online: <http://doi.acm.org/10.1145/357172.357176>. Accessed 2002 Jan. 28.
(Lampson 1986). Lampson B. 1986. Designing a global name service. In: Proceedings of the Fifth Symposium on the Principles of Distributed Computing; 1986; August; Minaki, Canada; Pages 1-10.
Available online: <http://doi.acm.org/10.1145/10590.10591>. Accessed 2002 Jan. 28.
(Li 2000). Li J, Jannotti J, Couto D. S. J. D, Karger D. R, Morris R. 2000. A scalable location service for geographical ad hoc routing. In: Proceedings of  ACM MOBICOM 2000; 2000; Boston, MA; Pages 120-130.
Available online: <http://doi.acm.org/10.1145/345910.345931>. Accessed 2002 Jan. 28.
(Milgram 1967). Milgram S, 1967. The small world problem. Psychology Today. Volume 1(1); Pages 60-67.
(Plaxton 1999). Plaxton C.G, Rajaraman R, Richa A.W. 1999. Accessing nearby copies of replicated objects in a distributed environment. In: Theory of Computing Systems; 1999; Pages 241-280.
(Ratnasamy 2001). Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. 2001. A scalable content­addressable network. In: Proceedings of ACM SIGCOMM'01; 2001; August; San Diego, CA; Pages 161-172.
Available online: <http://doi.acm.org/10.1145/383059.383072>. Accessed 2002 Jan. 28.
(Reynolds 1992). Reynolds J. 1992. RFC 1309: Technical overview of directory services using the X.500 protocol; 1992; March.
(Rowstron 2001a). Rowstron A, Druschel P. 2001. Storage management and caching in PAST, a large­scale, persistent peer­to­peer storage utility. In: Proceedings of  ACM SOSP'01; 2001; October; Banff, Canada; Pages 188-201.
Available online: <http://doi.acm.org/10.1145/502034.502053>. Accessed 2002 Jan. 28.
(Rowstron 2001b). Rowstron A, Druschel P. 2001. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of IFIP/ACM Middleware; 2001; Heidelberg, Germany.
(Saroiu 2001). Saroiu S, Gummadi P.K, Gribble S.D. 2001. A measurement study of peer-to-peer file sharing systems. Technical Report UW-CSE-01-06-02; University of Washington; 2001; July
(Song 2000). Song D, Wagner D, Perrig A. 2000. Search on encrypted data. In: Proceedings of  of IEEE SRSP; 2000; May.
(Stoica 2001). Stoica I, Morris R, Karger D, Kaashoek M. F, Balakrishnan H. 2001. Chord: A scalable peer­to­peer lookup service for Internet applications. In: Proceedings of ACM SIGCOMM'01; 2001; August; San Diego, CA; Pages 149-160.
Available online: <http://doi.acm.org/10.1145/383059.383071>. Accessed 2002 Jan. 28.
(Tsuchiya 1988). Tsuchiya P.F. 1988. The Landmark hierarchy: A new hierarchy for routing in very large networks. In: Proceedings of SIGCOMM'88; 1988; Stanford, CA; Pages 35-42.
Available online: <http://dx.doi.org/10.1145/52325.52329>.
(Watts 1998). Watts D, Strogatz S. 1998. Collective dynamics of `small­world' networks. In: Nature 393; 1998; Pages 440­442.
Available online: <http://tam.cornell.edu/SS_nature_smallworld.pdf> Accessed 2002 Jan. 27.
(Weatherspoon 2001). Weatherspoon H, Wells C, Eaton P.R, Zhao B.Y, Kubiatowicz J.D. 2001. Silverback: A global­scale archival system. In: ACM SOSP; 2001.
(Zegura 1996). Zegura E, Calvert K, Bhattacharjee S. 1996. How to model an internetwork. In: INFOCOM96; 1996; San Francisco, CA.
(Zhao 2001). Zhao B.Y, Kubiatowicz J.D, Joseph A.D. 2001. Tapestry: An infrastructure for fault­resilient wide­area location and routing. Technical Report UCB//CSD­01­1141, U.C. Berkeley; 2001; April.
Available online: <http://www.cs.berkeley.edu/~ravenben/publications/CSD-01-1141.pdf> Accessed 2002 Jan. 27.
(Zipf 1949). Zipf G.K. 1949. Human Behavior and the Principle of Least Effort. Addison-Wesley; 1949.
 

 

 

CSE | OGI
Page modified: 14 Feb 2002 01:01 PM