Abstract
This paper introduces Lighthouse, a scalable location mechanism for wide-area networks. Unlike existing vector-based systems such as GNP, we show how network-location can be established without using a fixed set of reference points. This lets us avoid the communication bottlenecks and single-points-of-failure that otherwise limit the practicality of such systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Silaghi, B., Bhattacharjee, S., Keleher, P.: Query Routing in the TerraDir Distributed Directory (submitted for Publication) (2001)
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)
Corwin, L., Szczarba, R.: Calculus in Vector Spaces, 2nd edn. Marcel Dekker Inc. (1994)
Farago, A., Linder, T., Lugosi, G.: Fast nearest-neighbor search in dissimilarity spaces. IEEE Trans. on Pattern Analysis and Machine Intelligence 15(9), 957–962 (1993)
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 9(5), 525–540 (2001)
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)
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)
Jacobs, D., Weinshall, D., Gdalyahu, Y.: Classification with non-metric distances: Image retrieval and class representation. IEEE Trans. on Pattern Analysis and Machine Intelligence 22(6), 583–600 (2000)
Kommareddy, C., Shankar, N., Bhattacharjee, B.: Finding close friends on the internet. In: ICNP 2001, Riverside (CA), USA (November 2001)
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. 2429, p. 66. Springer, Heidelberg (2002)
Oram, A.: Peer-to-peer: Harnessing the power of disruptive technologies. O’Reilly, Sebastopol (2001)
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. 2218, p. 329. Springer, Heidelberg (2001)
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. 2429, p. 45. Springer, Heidelberg (2002)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware Overlay Construction and Server Selection. In: IEEE INFOCOM 2002, New York, USA (June 2002)
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)
Shapiro, M.: The choice of reference points in best-match file searching. Communication of the ACM 20(5) (1977)
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)
Eugene Ng, T.S., Zhang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: IEEE INFOCOM 2002, New York, USA (June 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pias, M., Crowcroft, J., Wilbur, S., Harris, T., Bhatti, S. (2003). Lighthouses for Scalable Distributed Location. In: Kaashoek, M.F., Stoica, I. (eds) Peer-to-Peer Systems II. IPTPS 2003. Lecture Notes in Computer Science, vol 2735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45172-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-45172-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40724-9
Online ISBN: 978-3-540-45172-3
eBook Packages: Springer Book Archive