{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T17:51:36Z","timestamp":1775325096453,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540428008","type":"print"},{"value":"9783540455189","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45518-3_18","type":"book-chapter","created":{"date-parts":[[2007,11,21]],"date-time":"2007-11-21T20:23:38Z","timestamp":1195676618000},"page":"329-350","source":"Crossref","is-referenced-by-count":2297,"title":["Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems"],"prefix":"10.1007","author":[{"given":"Antony","family":"Rowstron","sequence":"first","affiliation":[]},{"given":"Peter","family":"Druschel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"18_CR1","unstructured":"Napster. http:\/\/www.napster.com\/ ."},{"key":"18_CR2","unstructured":"The Gnutella protocol specification, 2000. http:\/\/dss.clip2.com\/GnutellaProtocol04.pdf ."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"W. Adjie-Winoto, E. Schwartz, H. Balakrishnan, and J. Lilley. The design and implementation of an intentional naming system. In Proc. SOSP\u201999, Kiawah Island, SC, Dec. 1999.","DOI":"10.1145\/319151.319164"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Y. Amir, A. Peterson, and D. Shaw. Seamlessly selecting the best copy from Internet-wide replicated web servers. In Proc. 12th Symposium on Distributed Computing, Andros, Greece, Sept. 1998.","DOI":"10.1007\/BFb0056471"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proc. SIGMETRICS\u20192000, Santa Clara, CA, 2000.","DOI":"10.1145\/339331.339345"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1002\/spe.4380200406","volume":"20","author":"M. Bowman","year":"1990","unstructured":"M. Bowman, L.L. Peterson, and A. Yeatts. Univers: An attribute-based name server. Software \u2014 Practice and Experience, 20(4):403\u2013424, Apr. 1990.","journal-title":"Software \u2014 Practice and Experience"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/63404.63406","volume":"7","author":"D. R. Cheriton","year":"1989","unstructured":"D. R. Cheriton and T. P. Mann. Decentralizing a global naming service for improved performance and fault tolerance. ACM Trans. Comput. Syst., 7(2):147\u2013183, May 1989.","journal-title":"ACM Trans. Comput. Syst."},{"key":"18_CR8","first-page":"311","volume-title":"Workshop on Design Issues in Anonymity and Unobservability","author":"I. Clarke","year":"2000","unstructured":"I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Workshop on Design Issues in Anonymity and Unobservability, pages 311\u2013320, July 2000. ICSI, Berkeley, CA, USA."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. ACM SOSP\u201901, Banff, Canada, Oct. 2001.","DOI":"10.1145\/502034.502054"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"R. Dingledine, M. J. Freedman, and D. Molnar. The Free Haven project: Distributed anonymous storage service. In Proc. Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, July 2000.","DOI":"10.1007\/3-540-44702-4_5"},{"key":"18_CR11","volume-title":"Proc. HotOS VIII","author":"P. Druschel","year":"2001","unstructured":"P. Druschel and A. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility. In Proc. HotOS VIII, Schloss Elmau, Germany, May 2001."},{"key":"18_CR12","unstructured":"J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. W. O\u2019Toole. Overcast: Reliable multicasting with an overlay network. In Proc. OSDI 2000, San Diego, CA, 2000."},{"key":"18_CR13","unstructured":"J. Kangasharju, J. W. Roberts, and K. W. Ross. Performance evaluation of redirection schemes in content distribution networks. In Proc. 4th Web Caching Workshop, San Diego, CA, Mar. 1999."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"J. Kangasharju and K. W. Ross. A replicated architecture for the domain name system. In Proc. IEEE Infocom 2000, Tel Aviv, Israel, Mar. 2000.","DOI":"10.1109\/INFCOM.2000.832240"},{"key":"18_CR15","unstructured":"J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for globalscale persistent store. In Proc. ASPLOS\u20192000, Cambridge, MA, November 2000."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"B. Lampson. Designing a global name service. In Proc. Fifth Symposium on the Principles of Distributed Computing, pages 1\u201310, Minaki, Canada, Aug. 1986.","DOI":"10.1145\/10590.10591"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"J. Li, J. Jannotti, D. S. J. D. Couto, D. R. Karger, and R. Morris. A scalable location service for geographical ad hoc routing. In Proc. of ACM MOBICOM 2000, Boston, MA, 2000.","DOI":"10.1145\/345910.345931"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s002240000118","volume":"32","author":"C. G. Plaxton","year":"1999","unstructured":"C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 32:241\u2013280, 1999.","journal-title":"Theory of Computing Systems"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. ACM SIGCOMM\u201901, San Diego, CA, Aug. 2001.","DOI":"10.1145\/383059.383072"},{"key":"18_CR20","unstructured":"J. Reynolds. RFC 1309: Technical overview of directory services using the X.500 protocol, Mar. 1992."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. ACM SOSP\u201901, Banff, Canada, Oct. 2001.","DOI":"10.1145\/502034.502053"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"A. Rowstron, A.-M. Kermarrec, P. Druschel, and M. Castro. Scribe: The design of a large-scale event notification infrastructure. Submitted for publication. June 2001. http:\/\/www.research.microsoft.com\/antr\/SCRIBE\/ .","DOI":"10.1007\/3-540-45546-9_3"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"M. A. Sheldon, A. Duda, R. Weiss, and D. K. Gifford. Discover: A resource discovery system based on content routing. In Proc. 3rd International World Wide Web Conference, Darmstadt, Germany, 1995.","DOI":"10.1016\/0169-7552(95)00044-8"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. ACM SIGCOMM\u201901, San Diego, CA, Aug. 2001.","DOI":"10.1145\/383059.383071"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"P. F. Tsuchiya. The landmark hierarchy: a new hierarchy for routing in very large networks. In SIGCOMM\u201988, Stanford, CA, 1988.","DOI":"10.1145\/52324.52329"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork. In INFOCOM\u201996, San Francisco, CA, 1996.","DOI":"10.1109\/INFCOM.1996.493353"},{"key":"18_CR27","unstructured":"B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB\/\/CSD-01-1141, U. C. Berkeley, April 2001."}],"container-title":["Lecture Notes in Computer Science","Middleware 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45518-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T19:07:15Z","timestamp":1556996835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45518-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428008","9783540455189"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45518-3_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}