Load balancing and locality in range-queriable data structures

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 115-124

  Aspnes, James ^a   Kirsch, Jonathan ^a   Krishnamurthy, Arvind ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

Overlay networks; Peer to peer systems

Indexed keywords

ALGORITHMS; DISTRIBUTED DATABASE SYSTEMS; GRAPH THEORY; INSERTION LOSSES; MECHANISMS; NETWORK PROTOCOLS; SERVERS; STATISTICAL METHODS;

CROSS MACHINE BOUNDARIES; DISTRIBUTED DATA STRUCTURES; OVERLAY NETWORKS; PEER-TO-PEER SYSTEMS;

DATA STRUCTURES;

EID: 10444269335     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011785     Document Type: Conference Paper

References (25)

1. A. Andersson and O. Petersson. Approximate Indexed Lists. Journal of Algorithms, 29, 1998.
2. J. Aspnes and G. Shah. Skip Graphs. In Proceedings of Symposium on Discrete Algorithms, 2003.
3. B. Awerbuch and C. Scheideler. Peer-to-peer systems for Prefix Search. In Proceedings of the Symposium on Principles of Distributed Computing, 2003.
4. M. A. Bender, R. Cole, E. D. Demaine, M. Farach-Colton, and J. Zito. Two Simplified Algorithms for Maintaining Order in a List. In 10th European Symposium on Algorithms, pages 152-164, 2002.
5. R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. Journal of the ACM, 46(5):720-748, 1999.
6. P. Dietz, J. I. Seiferas, and J. Zhang. A Tight Lower Bound for On-Line Monotonic List Labeling. In 4th Scandinavian Workshop on Algorithm Theory, volume 824 of Lecture Notes in Computer Science, pages 131-142. Springer-Verlag, 1994.
7. P. Dietz and J. Zhang. Lower Bounds for Monotonic List Labeling. In 2nd Scandinavian Workshop on Algorithm Theory, volume 447 of Lecture Notes in Computer Science, pages 173-180. Springer-Verlag, 1990.
8. M. Harren, J. Hellerstein, R. Huebsch, B. Loo, S. Shenker, and I. Stoica. Complex queries in DHT-based peer-to-peer networks. In Proceedings of IPTPS02, 2002.
9. N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. SkipNet: A Scalable Overlay Network with Practical Locality Properties. In Proc. of Fourth USENIX Symposium on Internet Technologies and Systems, 2003.
10. A. Itai, A. G. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In Eighth International Colloquium on Automata, Languages and Programming, volume 115 of Lecture Notes in Computer Science, pages 417-431. Springer-Verlag, 1981.
11. T. Johnson and C. A. A Distributed Data-Balanced Dictionary Based on the B-Link Tree. Technical Report MIT/LCS/TR-530, MIT Laboratory for Computer Science, 1992.
12. 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. In Proc. of Symposium on Theory of Computing, 1997.
13. D. R. Karger and M. Ruhl. Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. In ACM Symposium on Parallelism in Algorithms and Architectures, June 2004.
14. P. Keleher, B. Bhattacharjee, and B. Silaghi. Are virtualized overlay networks too much of a good thing. In Proc. of the 1st International Workshop on Peer-to-Peer Systems, 2002.
15. P. Kirschenhofer and H. Prodinger. The path length of random skip lists. Acta Inf., 31(9), 1994.
16. T. Papadakis, J. I. Munro, and P. V. Poblete. Analysis of the expected search cost in skip lists. In Proceedings of the second Scandinavian workshop on Algorithm theory, 1990.
17. L. Peterson, T. Anderson, D. Culler, and T. Roscoe. A Blueprint for Introducing Disruptive Technology into the Internet. In Workshop on Hot Topics in Networks (HotNets), 2002.
18. W. Pugh. Skip Lists: A Probabilistic Alternative to Balanced Trees. In Workshop on Algorithms and Data Structures, 1989.
19. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content Addressable Network. In Proceedings of ACM SIGCOMM, 2001.
20. S. Ratnasamy, J. Hellerstein, and S. Shenker. Range Queries over DHTs. Technical Report IRB-TR-03-009, Intel Research, 2003.
21. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In International Conference on Distributed Systems Platforms, 2002.
22. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In Proceedings of SIGCOMM, 2001.
23. S. Suri, C. D. Tóth, and Y. Zang. Uncoordinated Load Balancing and Congestion Games in P2P Systems. In Proceedings of the Third International Workshop on Peer-to-Peer Systems, 2004.
24. D. E. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation, 97(2): 150-204, Apr. 1992.
25. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz. Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications, 2004.