The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 311-320

  Awerbuch, Baruch ^a   Scheideler, Christian ^a  

^a Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; THEOREM PROVING;

CONCURRENT DATA STRUCTURES; LOGARITHMS;

DATA STRUCTURES;

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

References (23)

1. J. Aspnes and G. Shah. Skip graphs. In Proc. of 14th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 384-393, 2003.
2. Y. Aumann and M. A. Bender. Fault tolerant data structures. In Proc. of 37th IEEE Symposium on Foundations of Computer Science (FOCS), pages 580-589, 1996.
3. B. Awerbuch and C. Scheideler. The Hyperring: A low-congestion deterministic data structure for distributed environments. Technical report, Johns Hopkins University, 2003. See http://www.cs.jhu.edu/~scheideler.
4. P. Beame and F. Fich. Optimal bounds for the predecessor problem. In In Proc. of the 31st ACM Symposium on Theory of Computing (STOC), pages 295-304, 1999.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press/McGraw-Hill, 1990.
6. E. W. Dijkstra. Self stabilization in spite of distributed control. Communications of the ACM, 17:643-644, 1974.
7. T. Hagerup and C. Rüb. A guided tour of Chernoff bounds. Information Processing Letters, 33:305-308, 1989/90.
8. N. J. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. Skipnet: A scalable overlay network with practical locality properties. In USITS 2003
9. N. J. Harvey and I. Munro. Brief Announcement: Deterministic SkipNet. To appear in Proc. of the ACM/SIAM Symp. on Principles of Distributed Computing (PODC), 2003.
10. P. Krishna. Highly Scalable Data Balanced Distributed Search Structures. Ph.D. thesis, University of Florida, 1995.
11. X. Li and C. Plaxton. On name resolution in peer-to-peer networks. In Proc. of the 2nd Workshop on Principles of Mobile Computing, pages 82-89, 2002.
12. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proc. of the 21st ACM Symposium on Principles of Distributed Computing (PODC), 2002.
13. X. Messeguer. Skip trees, an alternative data structure to skip lists in a concurrent approach. Informatique Theorique et Applications 31(3):251-269, 1997.
14. I. Munro, T. Papadakis, and R. Sedgewick. Deterministic skip lists. In Proc. of the ACM/SIAM Symposium on Discrete Mathematics (SODA), pages 367-375, 1992.
15. M. Naor and U. Wieder. Novel architectures for p2p applications: the continuous-discrete approach. In SPAA Proceedings, 2003.
16. W. Paul, U. Vishkin, and H. Wagener. Parallel computation on 2-3 trees. RAIRO - Theoretical Informatics 17(4):397-404, 1983.
17. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. In Workshop on Algorithms and Data Structures, pages 437-449, 1989.
18. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In SIGCOMM 2001.
19. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001.
20. C. Scheideler. Universal Routing Strategies for Interconnection Networks. Lecture Notes in Computer Science 1390. Spinger, 1998.
21. D. Shasha and N. Goodman. Concurrent search structure algorithms. TODS 13(1):53-90, 1988.
22. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM 2001.
23. B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. UCB Technical Report UCB/CSD-01-1141, 2001.