Family Trees: An ordered dictionary with optimal congestion, locality, degree, and search time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 301-310

  Zatloukal, Kevin C ^a   Harvey, Nicholas J A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PHYSICAL NETWORK ADDRESS; TRAFFIC ROUTING;

ALGORITHMS; BANDWIDTH; BROADCASTING; COMPUTER SYSTEMS; PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING; TREES (MATHEMATICS);

DATA STRUCTURES;

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

References (19)

1. J. Aspnes and G. Shah. Skip Graphs. In 14th ACM-SIAM Symposium on Discrete Algorithms, Jan. 2003.
2. B. Awerbuch and C. Scheideler. The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments. In 17th International Symposium on Distributed Computing, Oct. 2003.
3. P. Bozanis and Y. Manolopolous. DSL: Accomodating Skip Lists in the SDDS Model. In Workshop on Distributed Data and Structures, June 2000.
4. L. Cowen, Compact Routing with Minimum Stretch. In Proceedings of the 10th Annual AOM-SIAM Symposium on Discrete Algorithms, Jan. 1999.
5. C. Gavoille and D. Peleg. Compact and Localized Distributed Data Structures. Technical Report 1261-01, LaBRI, Université Bordeaux I, Aug. 2001.
6. N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. SkipNet: A Scalable Overlay Network with Practical Locality Properties. In USENIX Symposium on Internet Technologies and Systems, Mar. 2003.
7. N. J. A. Harvey and J. I. Munro. Deterministic Skip-Net. In ACM Symposium on Principles of Distributed Computing, July 2003.
8. S. Iyer, A. Rowstron, and P. Druschel. Squirrel: A decentralized, peer-to-peer web cache. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing. ACM, July 2002.
9. M. F. Kaashoek and D. R. Karger. Koorde: A simple degree-optimal distributed hash table. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems, Feb. 2003.
10. D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigraphy, Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual A CM Symposium on Theory of Computing, pages 654-663, May 1997.
11. B. Kroll and P. Widmayer. Balanced distributed search trees do not exist. In Workshop on Algorithms and Data Structures, 1995.
12. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufman, 1992.
13. W. Litwin, M. A. Neimat, and D. A. Schneider. LH* - Linear hashing for distributed files. In ACM SIGMOD Intl. Conf. on Management of Data, 1993.
14. W. Litwin, M. A. Neimat, and D. A. Schneider. RP* A family of order-preserving scalable distributed data structures. In Conf. on Very Large Data Bases, 1994.
15. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing. ACM, July 2002.
16. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proc. of ACM SIGCOMM, Aug. 2001.
17. A. Rowstron, A.-M, Kermarrec, M. Castro, and P. Druschel. Scribe: The design of a large-scale event notification infrastructure. In Third International Workshop on Networked Group Communications, 2001.
18. 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 ACM SIGCOMM, Aug. 2001.
19. M. Theimer and M. B. Jones. Overlook: Scalable Name Service on an Overlay Network. In Proceedings of the 22nd International Conference on Distributed Computing Systems, July 2002.