Weighted distributed hash tables

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 218-227

  Schindelhauer, Christian ^a   Schomaker, Gunnar ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Adaptive hashing; Consistent hashing; Non uniform disks; Peer to Peer Networks; Storage Area Networks; Web caching

Indexed keywords

BUFFER STORAGE; DATA STRUCTURES; TELECOMMUNICATION NETWORKS; WORLD WIDE WEB;

PEER-TO-PEER (P2P) NETWORKS; STORAGE AREA NETWORK (SAN); WEB CACHING;

PARALLEL PROCESSING SYSTEMS;

EID: 32144452931     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1074008     Document Type: Conference Paper

References (17)

1. P. K. Agarwal and M. Sharir. Simple bounds. In Davenport-Schinzel Sequences and Their Geometric Applications, chapter 1, pages 1-47. Cambridge University Press, in handbook of computational geometry edition, 1995. ISBN 0-521-47025-0.
2. P. Bleckmann, S. Böttcher, E. Cesnavicius, A. Francisco, T. D. Hollerung, B. Kühnel, M. J. Liu, S. Obermeier, S. Oberthür, F. Peter, F. Rammig, C. Schindelhauer, G. Schomaker, T. Steenweg, Q. A. Tarar, M. Tiemeyer, A. Türling, and A. Vater. The design of pamanet the paderborn mobile ad-hoc network. In MobiWac'04: Proceedings of the second international workshop on Mobility management & wireless access protocols, pages 119-121, New York, NY, USA, 2004. ACM Press.
3. A. Brinkmann, F. Meyer auf der Heide, K. Salzwedel, C. Scheideler, M. Vodisek, and U. Rückert. Storage management as means to cope with exponential information growth. In Proceedings of SSGRR 2003, L'Aquila, Italy, 28 July - 3 Aug. 2003.
4. A. Brinkmann, K. Salzwedel, and C. Scheideler. Efficient, distributed data placement strategies for storage area networks (extended abstract). In Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, pages 119-128. ACM Press, 2000.
5. A. Brinkmann, K. Salzwedel, and C. Scheideler. Compact, adaptive placement schemes for non-uniform distribution requirements. In Proc. of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 53-62, Winnipeg, Manitoba, Canada, 11-13 Aug. 2002.
6. J. Byers, J. Considine, and M. Mitzenmacher. Simple load balancing for distributed hash tables. Technical report, BU Computer Science, 2002.
7. P. Druschel and A. Rowstron. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In R. Guerraoui, editor, Middleware 2001, IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, Germany, November 12-16, 2001, Proceedings, volume 2218 of Lecture Notes in Computer Science, pages 329-350. Springer, 2001.
8. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao. Distributed object location in a dynamic network. In Proceedings of the 14th Annual ACM Symposium on Parallel ALgorithms and Architectures (SPAA-02), pages 41-52, New York, Aug. 10-13 2002. ACM Press.
9. D. Karger, E. Lehman, 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. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 654-663, El Paso, Texas, 4-6 May 1997.
10. D. R. Karger and M. F. Kaashoek. Koorde: A simple degree-optimal distributed hash table. In Proc. 2nd IPTPS, Berkeley, CA, Feb. 2003, Feb. 10 2003.
11. M. Mitzenmacher. The power of two choices in randomized load balancing. IEEE Transactions on Parallel and Distributed Systems, 12(10):1094-1104, 2001.
12. M. Naor and U. Wieder. Novel architectures for p2p applications: the continuous-discrete approach. In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pages 50-59. ACM Press, 2003.
13. C. G. Plaxton, R. Rajaraman, and A. Richa. Accessing nearby copies of replicated objects in a distributed environment. In 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'97), pages 311-320, New York, June 1997. Association for Computing Machinery.
14. A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica. Load balancing in structured p2p systems. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), 2003.
15. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Computer Communication Review, volume 31, pages 161-172. Dept. of Elec. Eng. and Comp. Sci., University of California, Berkeley, 2001.
16. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In R. Guerin, editor, Proceedings of the ACM SIGCOMM 2001 Conference (SIGCOMM-01), volume 31, 4 of Computer Communication Review, pages 149-160, New York, Aug. 27-31 2001. ACM Press.
17. B. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley, Apr. 2001.