Multiple choice tries and distributed hash tables

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 891-899

  Devroye, Luc ^a   Lugosi, Gabor ^b   Park, Gahyun ^c   Szpankowski, Wojciech ^d  

^a MCGILL UNIVERSITY   (Canada)

^b DEPARTMENT OF ECONOMICS AND BUSINESS   (Spain)

^c UNIVERSITY OF WISCONSIN WHITEWATER   (United States)

^d Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

DEPTH OF INSERTION; DISTRIBUTED HASH TABLE; GREEDY ALGORITHMS; HIGH PROBABILITY; MEMORYLESS SOURCE; MULTIPLE CHOICE; ON-LINE ALGORITHMS; TOTAL COMPUTATION TIME;

PEER TO PEER NETWORKS;

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

References (40)

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: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003.
2. M. Adler, E. Halperin, R. M. Karp, and V. V. Vazirani, "A stochastic process on the hypercube with applications to peer-to-peer networks.," in: Proceedings of the 35th ACM Symposium on Theory of Computing (STOC 2003), pp. 575-584, 2003.
3. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, "Balanced allocations (extended abstract)," in: Proceedings of the 26th ACM Symposium on the Theory of Computing, pp. 593-602, 1994.
4. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, "Balanced allocations," SIAM Journal on Computing, vol. 29, pp. 180-200, 1999.
5. H. Balakrishnan, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Looking up data in P2P systems," Communications of the ACM, vol. 1946, pp. 43-48, 2003.
6. H. Balakrishnan, S. Shenker, and M. Walfish, "Peering peertopeer providers," in: Peer-to-Peer Systems IV, 4th International Workshop, IPTPS 2005, Ithaca, NY, (edited by M. Castro, R. van Renesse (eds)), vol. 3640, pp. 104-114, Lecture Notes in Computer Science, Springer-Verlag, 2005.
7. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, Amsterdam, 1976.
8. E. G. Coffman and J. Eve, "File structures using hashing functions," Communications of the ACM, vol. 13, pp. 427-436, 1970.
9. A. Czumaj and V. Stemann, "Randomized Allocation Processes," in: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS'97), October 19-22, 1997, Miami Beach, FL, pp. 194-203, 1997.
10. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide-area cooperative storage with CFS," in: Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001), pp. 202-215, 2001.
11. P. Deheuvels, "On the Erdös-Rényi theorem for random fields and sequences and its relationships with the theory of runs and spacings," Zeitschrift für Wahrscheinlichkeit-stheorie und verwandte Gebiete, vol. 70, pp. 91-115, 1985.
12. L. Devroye, "Laws of large numbers and tail inequalities for random tries and Patricia trees," Journal of Computational and Applied Mathematics, vol. 142, pp. 27-37, 2002.
13. L. Devroye, G. Lugosi, G. Park, and W. Szpankowski "Multiple Choice Tries", preprint 2006.
14. P. Erdös and A. Rényi, "On a new law of large numbers," J. Anal. Math., vol. 22, pp. 103-111, 1970.
15. E. H. Fredkin, "Trie memory," Communications of the ACM, vol. 3, pp. 490-500, 1960.
16. P. Hall, "On representatives of subsets," Journal of the London Mathematical Society, vol. 10, pp. 26-30, 1935.
17. P. Jacquet and M. Régnier, "Trie partitioning process: limiting distributions," in: CAAP 86, (edited by P. Franchi-Zannettacci), vol. 214, pp. 196-210, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1986.
18. D. R. Karger and M. Ruhl, "New algorithms for load balancing in peer-to-peer systems," IRIS Student Workshop, 2003.
19. D. E. Knuth, The Art of Computer Programming, Vol. 3 : Sorting and Searching, Addison-Wesley, Reading, Mass., 1973.
20. A. G. Konheim and D. J. Newman, "A note on growing binary trees," Discrete Mathematics, vol. 4, pp. 57-63, 1973.
21. P. Lévy, "Sur la division d'un segment par des points choisis au hasard," Comptes Rendus Acad. Sci. Paris, vol. 208, pp. 147-149, 1939.
22. D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A scalable and dynamic emulation of the butterfly," in: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 183-192, 2002.
23. G. S. Manku, M. Bawa, and P. Raghavan, "Symphony: Distributed hashing in a small world," in: Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems (USITS 2003), pp. 127-140, 2003.
24. G. S. Manku, "Balanced binary trees for ID management and load balance in distributed hash tables," in: 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 197-205, 2004.
25. D. R. Morrison, "patricia - Practical Algorithm To Retrieve Information Coded in Alphanumeric," Journal of the ACM, vol. 15, pp. 514-534, 1968.
26. M. Naor and U. Wieder, "Novel architectures for P2P applications: The continuous-discrete approach," in: Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2003), pp. 50-59, 2003.
27. S. Yu. Novak, "On the Erdos-Rényi maximum of partial sums," Theory of Probability and its Applications, vol. 42, pp. 254-270, 1995.
28. R. Pagh and F. F. Rodler, "Cuckoo hashing," BRICS Report Series RS-01-32, Department of Computer Science, University of Aarhus, 2001.
29. B. Pittel, "Asymptotical growth of a class of random trees," Annals of Probability, vol. 13, pp. 414-427, 1985.
30. B. Pittel, "Path in a random digital tree: limiting distributions," Advances in Applied Probability, vol. 18, pp. 139-155, 1986.
31. R. Pyke, "Spacings," Journal of the Royal Statistical Society, vol. 27, pp. 395-436, 1965.
32. S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein, and S. Shenker, "Prefix hash tree: An indexing data structure over distributed hash tables," IRB Technical Report, 2004.
33. S. Ratnasamy, P. Francis, M. Handley, and R. M. Karp, "A scalable content-addressable network," in: Proceedings of the ACM SIGCOMM 2001, pp. 161-172, 2001.
34. M. Régnier and P. Jacquet, "New results on the size of tries," IEEE Transactions on Information Theory, vol. IT-35, pp. 203-205, 1989.
35. A. Rényi, "On the dimension and entropy of probability distributions," Acta Mathematica Academiae Sci. Hungarica, vol. 10, pp. 193-215, 1959.
36. W. Szpankowski, "Some results on V-ary asymmetric tries," Journal of Algorithms, vol. 9, pp. 224-244, 1988.
37. W. Szpankowski, "A characterization of digital search trees from the successful search viewpoint," Theoretical Computer Science, vol. 85, pp. 117-134, 1991.
38. W. Szpankowski, "On the height of digital trees and related problems," Algorithmica, vol. 6, pp. 256-277, 1991.
39. W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Springer-Verlag, New York, 2001.
40. R. E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.