Object location in realistic networks

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 25-35

  Hildrum, Kirsten ^a   Krauthgamer, Robert ^b   Kubiatowicz, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

DHT; Distributed object location; Dolr, distributed hash table; Locality; Networking; Overlay; Peer to peer

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL METHODS; DATA STRUCTURES; LOCAL AREA NETWORKS; NETWORK PROTOCOLS; ROUTERS; SERVERS; TABLE LOOKUP; TELECOMMUNICATION TRAFFIC; THEORY;

DISTRIBUTED HASH TABLE (DHT); DISTRIBUTED OBJECT LOCATION AND ROUTING (DOLR); LOCALITY; NETWORKING; OVERLAY; PEER-TO-PEER;

TELECOMMUNICATION NETWORKS;

EID: 8344246915     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007918     Document Type: Conference Paper

References (32)

1. I. Abraham, D. Malkhi, and O. Dobzinski. LAND: Stretch (1 + ε) locality-aware networks for DHTs. In 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 543-552, Jan. 2004.
2. M. Arias, L. J. Cowen, and K. A. Laing. Compact roundtrip routing with topology-independent node names. In Proceedings of 22nd Annual Symposium on Principles of Distributed Computing, pages 43-52, 2003.
3. M. Arias, L. J. Cowen, K. A. Laing, R. Rajaraman, and O. Taka. Compact routing with name independence. In Proceedings of 15th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 184-192, 2003.
4. B. Awerbuch and D. Peleg. Concurrent online tracking of mobile users. In Proc. of SIGCOMM, pages 221-233, 1991.
5. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proceedings of SOSP, pages 202-215, 2001.
6. F. Dabek, J. Li, E. Sit, J. Robertson, M. F. Kaashoek, and R. Morris. Designing a dht for low latency and high throughput. In Proceedings of the First Symposium on Networked Systems Design and Implementation, pages 85-98, Mar. 2004.
7. F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. . Stoica. Towards a common API for structured P2P overlays. In Proceedings of IPTPS, pages 33-44, 2003.
8. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In Proceedings of IEEE INFOCOM, 2004.
9. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The impact of DHT routing geometry on resilience and proximity. In Proc. of SIGCOMM, pages 381-394, 2003.
10. K. Hildrum and J. Kubiatowicz. Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In 17th International Symposium on Distributed Computing, pages 321-336, 2003.
11. K. Hildrum, J. Kubiatowicz, S. Ma, and S. Rao. A note on finding the nearest neighbor in growth-restricted metrics. In Proceedings of 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 553-554, 2004.
12. K. Hildrum, J. Kubiatowicz, and S. Rao. Another way to find the nearest neighbor in growth-restricted metrics. Technical Report UCB/CSD-03-1267, UC Berkeley, 2003.
13. K. Hildrum, J. Kubiatowicz, S. Rao, and B. Y. Zhao. Distributed object location in a dynamic network. In 14th ACM SPAA, pages 41-52, 2002.
14. R. Huebsch, J. M. Hellerstein, N. L. Boon, T. Loo, S. Shenker, and I. Stoica. Querying the internet with pier. In Proceedings of 19th International Conference on Very Large Databases (VLDB), Sept. 2003.
15. D. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In Proc. of the 34th ACM Symp. on Theory of Comp., pages 741-750, 2002.
16. R. Krauthgamer and J. R. Lee. The black-box complexity of nearest neighbor search. In 31st International Colloquium on Automata, Languages and Programming. July 2004. To appear.
17. R. Krauthgamer and J. R. Lee. Navigating nets: Simple algorithms for proximity search. In 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 791-801, Jan. 2004.
18. J. Kubiatowicz et al. OceanStore: An architecture for global-scale persistent storage. In Proc. of ACM ASPLOS, pages 190-201. ACM, 2000.
19. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In Proceedings of IEEE INFOCOM, 2003.
20. X. Li and C. G. Plaxton. On name resolution in peer-to-peer networks. In 2nd Workshop on Principles of Mobile Computing, pages 82-89, 2002.
21. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 32:241-280, 1999.
22. R. Rajaraman, A. W. Richa, B. Vocking, and G. Vuppuluri. A data tracking scheme for general networks. In Symposium on Parallel Algorithms and Architectures, pages 247-254, 2001.
23. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In Proc. of SIGCOMM, pages 161-172, 2001.
24. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a DHT. To appear in USENIX '04 Annual Technical Conference.
25. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a DHT. Technical Report UCB//CSD-03-1299, UC Berkeley, 2003.
26. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of IFIP/ACM Middleware, pages 329-350, 2001.
27. A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of SOSP, pages 188-201, 2001.
28. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of SIGCOMM, pages 149-160, 2001.
29. M. Thorup and U. Zwick. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp., pages 183-192, July 2001.
30. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to model an internetwork. In Proceedings of IEEE INFOCOM, pages 594-602, 1996.
31. B. Y. Zhao, L. Huang, S. C. Rhea, J. Stribling, A. D. Joseph, and J. Kubiatowicz. Tapestry: A global-scale overlay for rapid service deployment. IEEE Journal on Selected Areas in Communications, 2003. Special Issue on Service Overlay Networks, to appear.
32. B. Y. Zhao, J. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, 2001.