LAND: Stretch (1 + ε) Locality-Aware Networks for DHTs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 543-552

  Abraham, Ittai ^a   Malkhi, Dahlia ^a   Dobzinski, Oren ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTATIONAL COMPLEXITY; COSTS; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; OPTIMIZATION; PROBABILITY; ROUTERS; SERVERS; WEBSITES;

DISTRIBUTED HASH TABLE (DTH); PEER-TO-PEER NETWORK; SERVICE-POINT ARCHITECTURE;

COMPUTER NETWORKS;

EID: 1842435165     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. I. Abraham, B. Awerbuch, Y. Azar, Y. Bartal D. Malkhi and E. Pavlov. "A Generic Scheme for Building Overlay Networks in Adversarial Scenarios". In International Parallel and Distributed Processing Symposium (IPDPS 2003), April 2003, Nice, France.
2. I. Abraham, D. Malkhi and O. Dobzinski. "LAND: Locality Aware Networks for Distributed Hash Tables". Technical Report 2003-75, Leibnitz Center of the School of Computer Science and Engineering, the Hebrew University of Jerusalm, July 2003.
3. R. Chand and P. Felber. "A Scalable Protocol for Content-Based Routing in Overlay Networks". In IEEE International Symposium on Network Computing and Applications (NCA'03), Cambridge, MA, April 2003.
4. P. Drushel and A. Rowstron. "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems". Proceeding of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), November 2001.
5. P. Fraigniaud and P. Gauron. "The Content-Addressable Network D2B". Technical Report 1349, LRI, Univ. Paris-Sud, France, January 2003.
6. C. Gavoille and M. Gengler. Space-efficiency for routing schemes of stretch factor three. Journal of Parallel and Distributed Computing, 61(5):679-687, 2001.
7. K. Hildrum, J. Kubiatowicz and S. Rao Another Way to Find the Nearest Neighbor in Growth-Restricted Metrics UC Berkeley, Computer Science Division Tecnical Report UCB/CSD-03-1267, August, 2003.
8. F. Kaashoek and D. R. Karger. "Koorde: A Simple Degree-optimal Hash Table". In 2nd International Workshop on Peer to Peer Systems (IPTPS '03), February 2003, Berkeley, CA.
9. D. Karger, E. Lehman, F. T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web". Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 654-663, May 1997.
10. D. R. Karger and M. Ruhl. "Finding Nearest Neighbors in Growth-restricted Metrics". ACM Symposium on Theory of Computing (STOC '02), Montreal, May 2002.
11. X. Li and C. G. Plaxton. "On name resolution in peer-to-peer networks." In Proceedings of the 2nd ACM Worskhop on Principles of Mobile Commerce (POMC), pp. 82-89, October 2002.
12. N. Lynch, D. Malkhi and D. Ratajczak. "Atomic data access in distributed hash tables". In Proceedings of the International Peer-to-Peer Symposium, March 2002.
13. D. Malkhi. "Dynamic Lookup Networks: A position paper". In Proceedings of the International Workshop on Future Directions in Distributed Computing (Fu-DiCo), LNCS Volume 2584, pp. 93-96. Bertinoro, Italy, 2002,
14. D. Malkhi, M. Naor and D. Ratajczak. "Viceroy: A scalable and dynamic emulation of the Butterfly". In Proceeding of the 21 st ACM Symposium on Principles of Distributed Computing (PODC'02), July 2002.
15. G.S Manku, M. Bawa, P. Raghavan. "Symphony: Distributed Hashing In Small World". In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003.
16. M. Naor and U. Wieder. "Novel Architectures for P2P Applications: the Continuous-Discrete Approach". In The Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '03), 2003.
17. C. Plaxton, R. Rajaraman, and A. Richa. "Accessing nearby copies of replicated objects in a distributed environment". Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 97), pp. 311-320, June 1997.
18. S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker. "A scalable content-addressable network". In Proceeding of the ACM SIGCOMM 2001 Technical Conference. August 2001.
19. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek and H. Balakrishnan. "Chord: A scalable peer-to-peer lookup service for Internet applications". In Proceedings of the SIGCOMM 2001, August 2001.
20. M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the thirty-third annual ACM symposium on Theory of computing (STOC '01), pages 183-192. ACM Press, 2001.
21. M. Thorup and U. Zwick. Compact routing schemes. In Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (SPAA '01), pages 1-10. ACM Press, 2001.
22. B.Y. Zhao, J. D. Kubiatowicz and A.D. Joseph. "Tapestry: An infrastructure for fault-tolerant wide-area location and routing". U.C. Berkeley Technical Report UCB/CDS-01-1141, April, 2001.