Lighthouses for scalable distributed location

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

Volumn 2735, Issue , 2003, Pages 278-291

  Pias, Marcelo ^a   Crowcroft, Jon ^b   Wilbur, Steve ^a   Harris, Tim ^b   Bhatti, Saleem ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LIGHTHOUSES; LOCATION; WIDE AREA NETWORKS;

NETWORK LOCATION; REFERENCE POINTS; SINGLE POINT;

PEER TO PEER NETWORKS;

EID: 35248866615     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45172-3_26     Document Type: Article

References (18)

1. B. Silaghi, S. Bhattacharjee, and P. Keleher. Query Routing in the TerraDir Distributed Directory. In Submitted for Publication, 2001.
2. B. Zhao, J. Kubiatowicz, and A. Joseph. 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.
3. L. Corwin and R. Szczarba. Calculus in Vector Spaces: 2nd edition. Marcel Dekker Inc., 1994.
4. A. Farago, T. Linder, and G. Lugosi. Fast nearest-neighbor search in dissimilarity spaces. IEEE Trans. on Pattern Analysis and Machine Intelligence, 15(9) :957-962, 1993.
5. P. Francis, S. Jamin, C. Jin, D. Raz, Y. Shavitt, and L. Zhang. Idmaps: A global internet host distance estimation service. IEEE/ACM Trans. on Networking, 9(5):525-540, 2001.
6. K. P. Gummadi, S. Saroiu, and S. Gribble. King: Estimating latency between arbitrary internet end hosts. In ACM SIGCOMM Internet Measurement Workshop (IMW'02), Marseille, France, November 2002.
7. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In ACM SIGCOMM'01 Conference, San Diego, USA, August 2001.
8. D. Jacobs, D. Weinshall, and Y. Gdalyahu. Classification with non-metric distances: Image retrieval and class representation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 22(6):583-600, 2000.
9. C. Kommareddy, N. Shankar, and B. Bhattacharjee. Finding close friends on the internet. In ICNP'01, Riverside (CA), USA, November 2001.
10. M. Freedman and R. Vingralek. Efficient Peer-To-Peer Lookup Based on a Distributed Trie. In 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), MIT, Cambridge, USA, March 2002.
11. Andy Oram. Peer-to-peer: Harnessing the power of disruptive technologies. O'Reilly, March 2001.
12. P. Druschel and A. Rowstron. Pastry: Scalable Distributed Object Location and Routing for Large-scale Peer to Peer Systems. In 18th IFIP/ACM Middleware 2001, November 2001.
13. S. Ratnasamy, , S. Shenker, and I. Stoica. Routing Algorithms for DHTs: Some Open Questions. In 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), MIT, Cambridge, USA, March 2002.
14. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-aware Overlay Construction and Server Selection. In IEEE INFOCOM'02, New York, USA, June 2002.
15. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In ACM SIGCOMM'01 Conference, San Diego, USA, August 2001.
16. M. Shapiro. The choice of reference points in best-match file searching. Communication of the ACM, 20(5), 1977.
17. T. Henderson. 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.
18. T. S. Eugene Ng and Hui Zhang. Predicting Internet Network Distance with Coordinates-Based Approaches. In IEEE INFOCOM' 02, New York, USA, June 2002.