Distributed object location in a dynamic network

Theory of Computing Systems

Volumn 37, Issue 3, 2004, Pages 405-440

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

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SHARING; DISTRIBUTED OBJECT LOCATION; DYNAMIC NETWORKS; QUERIES;

ALGORITHMS; BROADCASTING; DATA HANDLING; DATA STORAGE EQUIPMENT; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; ROUTERS; SET THEORY; THEOREM PROVING;

COMPUTER NETWORKS;

EID: 7444231101     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1146-6     Document Type: Article

References (37)

1. Awerbuch, B., and Peleg, D. Concurrent online tracking of mobile users. In Proc. SIGCOMM (Sept. 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. SIGMETRICS (June 2000), pp. 34-43.
4. Bourgain, J. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel Journal of Mathematics, 52 (1985), 46-52.
5. Castro, M., Druschel, P., Ganesh, A., and Rowstron, A. Secure routing for structured peer-to-peer overlay networks. In Proceedings of the 5th Symposium on Operating Systems Desgin and Implementation (Dec. 2002), pp. 299-314.
6. Castro, M., Druschel, P., Hu, Y. C., and Rowstron, A. Exploiting network proximity in peer-to-peer overlay networks. In Proceedings of the International Workshop on Future Directions in Distributed Computing (June 2002), pp. 52-55.
7. Clarke, I., Sandberg, O., Wiley, B., and Hong, T. W. Freenet: a distributed anonymous information storage and retrieval system. In Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability (H. Federrath, ed.). Lecture Notes in Computer Science 2009, pp. 46-66, Springer-Verlag, Berlin, 2001.
8. Clarkson, K. L. Nearest neighbor queries in metric spaces. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (May 1997), pp. 609-617.
9. Cowen, L. J. Compact routing with minimum stretch. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (Jan. 1999), pp. 255-260.
10. Douceur, J. The Sybil attack. In Proc. IPTPS (Mar. 2002), pp. 251-260.
11. Gavoille, C. Routing in distributed networks: overview and open problems. ACM SIGACT News, 32(1) (Mar. 2001), 36-52.
12. Gopal, B., and Manber, U. Integrating content-based access mechanisms with hierarchical file systems. In Proc. ACM OSDI (Feb. 1999), pp. 265-278.
13. Hildrum, K., and Kubiatowicz, J. Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In Proceedings of the 11th International Symposium on Distributed Computing (Oct. 2003), pp. 321-336.
14. Hildrum, K., Kubiatowicz, J. D., and Rao, S. Another way to find the nearest neighbor in growth-restricted metrics. Tech. Rep. UCB/CSD-03-1267, Computer Science Division, UC Berkeley, Aug. 2003.
15. Karger, D., and Ruhl, M. Find nearest neighbors in growth-restricted metrics. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (May 2002), pp. 741-750.
16. Krauthgamer, R., and Lee, J. Navigating nets: simple algorithms for proximity search. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (Jan. 2004), pp. 791-801.
17. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. OceanStore: an architecture for global-scale persistent storage. In Proc. ACM ASPLOS (Nov. 2000), pp. 190-201.
18. Li, X., and Plaxton, C. G. On name resolution in peer-to-peer networks. In Proceedings of the Second ACM International Workshop on Principles of Mobile Computing (Oct. 2002), pp. 82-89.
19. Linial, N., London, E., and Rabinovich, Y. The geometry of graphs and some of its algorithmic applications. In Proceedings of the IEEE Symposium oh Foundations of Computer Science (1994), pp. 577-591.
20. Liu, H., and Lam, S. S. Neighbor table construction and update in a dynamic peer-to-peer network. In Proc. IEEE ICDCS (May 2003), pp. 509-519.
21. Malkhi, D., Naor, M., and Ratajczak, D. Viceroy: a scalable and dynamic emulation of the butterfly. In Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing pp. 183-192. ACM Press, New York, 2002.
22. Oram, A., Ed. Peer-to-Peer, Harnessing the Power of Disruptive Technologies. O'Reilly, Cambridge, MA, 2001.
23. Peleg, D., and Upfal, E. A tradeoff between size and efficiency for routing tables. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (May 1989), pp. 43-52.
24. Plaxton, C. G., Rajaraman, R., and Richa, A. W. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the 9th Annual Symposium on Parallel Algorithms and Architectures (June 1997), pp. 311-320.
25. Rajaraman, R., Richa, A. W., Vöcking, B., and Vuppuluri, G. A data tracking scheme for general networks. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (July 2001), pp. 247-254.
26. Ramasamy, S., Francis, P., Handley, M., Karp, R., and Schenker, S. A scalable content-addressable network. In Proc. SIGCOMM (Aug. 2001), pp. 161-172.
27. Rowstron, A., and Druschel, P. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Nov. 2001), pp. 329-350.
28. Rowstron, A., and Druschel, P. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. SOSP (Oct. 2001), pp. 188-201.
29. Sit, E., and Morris, R. Security considerations for peer-to-peer distributed hash tables. In Proceedings of the First International Workshop on Peer-to-Peer Systems (Mar. 2002), pp. 261-269.
30. Stoics, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. Chord: a scalable peer-to-peer lookup service for internet applications. In Proc. SIGCOMM (Aug. 2001), pp. 149-160.
31. Stribling, J., Hildrum, K., and Kubiatowicz, J. D. Optimizations for locality-aware structured peer-to-peer overlays. Tech. Rep. UCB/CSD-03-1266, Computer Science Division, UC Berkeley, Aug. 2003.
32. Thorup, M., and Zwick, U. Approximate distance oracles. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (July 2001), pp. 183-192.
33. Thorup, M., and Zwick, U. Compact routing schemes. In Proceedings of the 13th Annual Symposium on Parallel Algorithms and Architectures (July 2001), pp. 1-10.
34. Zegura, E. W., Calvert, K., and Bhattacharjee, S. How to model an internetwork. In Proc. IEEE INFOCOM (Mar. 1996), vol. 2, pp. 594-602.
35. Zhao, B. Y., Huang, L., Rhea, S. C., Stribling, J., Joseph, A. D., and Kubiatowicz, J. D. Tapestry: a global-scale overlay for rapid service deployment. IEEE Journal on Selected Areas in Communications, 22(1) (2004), 41-53. Special Issue on Service Overlay Networks.
36. Zhao, B. Y., Joseph, A., and Kubiatowicz, J. Locality-aware mechanisms for large-scale networks. In Proceedings of the Workshop on Future Directions in Distributed Computing (June 2002), pp. 80-83.
37. 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, Computer Science Division, UC Berkeley, Apr. 2001.