{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:14:41Z","timestamp":1760955281057},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407249"},{"type":"electronic","value":"9783540451723"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45172-3_26","type":"book-chapter","created":{"date-parts":[[2011,1,17]],"date-time":"2011-01-17T18:40:01Z","timestamp":1295289601000},"page":"278-291","source":"Crossref","is-referenced-by-count":79,"title":["Lighthouses for Scalable Distributed Location"],"prefix":"10.1007","author":[{"given":"Marcelo","family":"Pias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Crowcroft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Wilbur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Harris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saleem","family":"Bhatti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Silaghi, B., Bhattacharjee, S., Keleher, P.: Query Routing in the TerraDir Distributed Directory (submitted for Publication) (2001)","DOI":"10.1117\/12.475281"},{"key":"26_CR2","unstructured":"Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing. In Technical Report UCB CSD-01-1141, University of California at Berkeley (November 2001)"},{"key":"26_CR3","unstructured":"Corwin, L., Szczarba, R.: Calculus in Vector Spaces, 2nd edn. Marcel Dekker Inc. (1994)"},{"issue":"9","key":"26_CR4","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/34.232083","volume":"15","author":"A. Farago","year":"1993","unstructured":"Farago, A., Linder, T., Lugosi, G.: Fast nearest-neighbor search in dissimilarity spaces. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a015(9), 957\u2013962 (1993)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"5","key":"26_CR5","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/90.958323","volume":"9","author":"P. Francis","year":"2001","unstructured":"Francis, P., Jamin, S., Jin, C., Raz, D., Shavitt, Y., Zhang, L.: Idmaps: A global internet host distance estimation service. IEEE\/ACM Trans. on Networking\u00a09(5), 525\u2013540 (2001)","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Gummadi, K.P., Saroiu, S., Gribble, S.: King: Estimating latency between arbitrary internet end hosts. In: ACM SIGCOMM Internet Measurement Workshop (IMW 2002), Marseille, France (November 2002)","DOI":"10.1145\/637202.637203"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: ACM SIGCOMM 2001 Conference, San Diego, USA (August 2001)","DOI":"10.1145\/383059.383071"},{"issue":"6","key":"26_CR8","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/34.862197","volume":"22","author":"D. Jacobs","year":"2000","unstructured":"Jacobs, D., Weinshall, D., Gdalyahu, Y.: Classification with non-metric distances: Image retrieval and class representation. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a022(6), 583\u2013600 (2000)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Kommareddy, C., Shankar, N., Bhattacharjee, B.: Finding close friends on the internet. In: ICNP 2001, Riverside (CA), USA (November 2001)","DOI":"10.1109\/ICNP.2001.992910"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-45748-8_6","volume-title":"Peer-to-Peer Systems","author":"M. Freedman","year":"2002","unstructured":"Freedman, M., Vingralek, R.: Efficient Peer-To-Peer Lookup Based on a Distributed Trie. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 66. Springer, Heidelberg (2002)"},{"key":"26_CR11","volume-title":"Peer-to-peer: Harnessing the power of disruptive technologies","author":"A. Oram","year":"2001","unstructured":"Oram, A.: Peer-to-peer: Harnessing the power of disruptive technologies. O\u2019Reilly, Sebastopol (2001)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Druschel, P., Rowstron, A.: Pastry: Scalable Distributed Object Location and Routing for Large-scale Peer to Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, p. 329. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-45748-8_4","volume-title":"Peer-to-Peer Systems","author":"S. Ratnasamy","year":"2002","unstructured":"Ratnasamy, S., Shenker, S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 45. Springer, Heidelberg (2002)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware Overlay Construction and Server Selection. In: IEEE INFOCOM 2002, New York, USA (June 2002)","DOI":"10.1109\/INFCOM.2002.1019369"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: ACM SIGCOMM 2001 Conference, San Diego, USA (August 2001)","DOI":"10.1145\/383059.383072"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Shapiro, M.: The choice of reference points in best-match file searching. Communication of the ACM\u00a020(5) (1977)","DOI":"10.1145\/359581.359599"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Henderson, T.: Observations on Game Server Discovery Mechanisms. In: ACM SIG MULTIMEDIA NetGames 2002: First Workshop on Network and System Support for Games, Braunschweig, Germany (April 2002)","DOI":"10.1145\/566500.566507"},{"key":"26_CR18","unstructured":"Eugene Ng, T.S., Zhang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: IEEE INFOCOM 2002, New York, USA (June 2002)"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems II"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45172-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T22:50:31Z","timestamp":1559947831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45172-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407249","9783540451723"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45172-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}