Distributed object location in a dynamic network

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2002, Pages 41-52

  Hildrum, Kirsten ^a   Kubiatowicz, John D ^a   Rao, Satish ^a   Zhao, Ben Y ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

DHT; Distributed hash table; Distributed object location; DOLR; Locality; Nearest neighbor; Networking; Overlay; Peer to peer; Tapestry

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC NETWORK TOPOLOGY; GATEWAYS (COMPUTER NETWORKS); MULTICASTING; QUERY LANGUAGES; ROUTERS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

DISTRIBUTED HASH TABLE; DISTRIBUTED OBJECT LOCATION; DYNAMIC NETWORK; LOCATION-INDEPENDENT ROUTING; TAPESTRY;

COMPUTER NETWORKS;

EID: 0036957830     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/564875.564877     Document Type: Conference Paper

References (22)

1. Awerbuch, B., and Peleg, D. Concurrent online tracking of mobile users. In Proc. of SIGCOMM (1991), pp. 221-233.
2. Awerbuch, B., and Peleg, D. Routing with polynomial communication-space trade-off. SIAM Journal on Discrete Mathematics 5, 2 (1992), 151-162.
3. Bolosky, W. J., Douceur, J. R., Ely, D., and Theimer, M. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proc. of SIGMETRICS (2000), ACM, pp. 34-43.
4. Bourgain, J. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math 52 (1985), 46-52.
5. Clarke, I., Sandberg, O., Wiley, B., and Hong, T. Freenet: A distributed anonymous information storage and retrieval system. In Designing Privacy Enhancing Technologies: Intl. Workshop on Design Issues in Anonymity and Unobservability (New York, 2000), H. Federrath, Ed., Springer.
6. Clarkson, K. L. Nearest neighbor queries in metric spaces. In Proc. of the 29th Annual ACM Symp. on Theory of Comp. (1997), pp. 609-617.
7. Cowen, L. J. Compact routing with minimum stretch. In Proc. of the 10th Annual ACM-SIAM Symp. on Discrete Algorithms (January 1999), ACM.
8. Gavoille, C. Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Comp. Column 32, 1 (Mar. 2001), 36-52.
9. Gopal, B., and Manber, U. Integrating content-based access mechanisms with hierarchical file systems. In Proc. of ACM OSDI (February 1999), ACM, pp. 265-278.
10. Karger, D., and Ruhl, M. Find nearest neighbors in growth-restricted metrics. In Proc. of the 34th Annual ACM Symp. on Theory of Comp. (May 2002), pp. 741-750.
11. Kubiatowicz, J., et al. OceanStore: An architecture for global-scale persistent storage. In Proc. of ACM ASPLOS (Nov 2000), ACM, pp. 190-201.
12. Oram, A., Ed. Peer-to-Peer, Harnessing the Power of Disruptive Technologies. O'Reilly Books, 2001.
13. Peleg, D., and Upfal, E. A tradeoff between size and efficiency for routing tables. In Proc. of the Twentieth Annual ACM Symp. on Theory of Comp. (May 1989), pp. 43-52.
14. Plaxton, C. G., Rajaraman, R., and Richa, A. W. Accessing nearby copies of replicated objects in a distributed environment. In Proc. of the 9th Annual Symp. on Parallel Algorithms and Architectures (June 1997), ACM, pp. 311-320.
15. Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Schenker, S. A scalable content-addressable network. In Proc. of SIGCOMM (Aug 2001), ACM, pp. 161-172.
16. Rowstron, A., and Druschel, P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of IFIP/ACM Middleware 2001 (November 2001).
17. Rowstron, A., and Druschel, P. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of SOSP (October 2001).
18. Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of SIGCOMM (Aug 2001), ACM, pp. 149-160.
19. Thorup, M., and Zwick, U. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp. (2001), pp. 183-192.
20. Thorup, M., and Zwick, U. Compact routing schemes. In Proc. of the 13th Annual Symp. on Parallel Algorithms and Architectures (2001), pp. 1-10.
21. Zhao, B. Y., Joseph, A., and Kubiatowicz, J. Locality-aware mechanisms for large-scale networks. In Proc. of Workshop on Future Directions in Distributed Comp. (June 2002).
22. Zhao, B. Y., Kubiatowicz, J. D., and Joseph, A. D. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, UC Berkeley, Computer Science Division, April 2001.