Viceroy: A scalable and dynamic emulation of the butterfly

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 183-192

  Malkhi, Dahlia ^a   Naor, Moni ^b   Ratajczak, David ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); DISTRIBUTED COMPUTER SYSTEMS; DYNAMIC PROGRAMMING; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; REQUIREMENTS ENGINEERING; TABLE LOOKUP; TREES (MATHEMATICS);

BALANCED SEARCH TREES; CONSTANT DEGREE ROUTING NETWORKS; DISTRIBUTED HASH TABLE; LOGARITHMIC FACTOR;

DATA COMMUNICATION SYSTEMS;

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

References (21)

1. N. Alon, M. Dietzfelbinger, P. B. Miltersen, E. Petrank, and G. Tardos. "Linear Hashing". Journal of the ACM Vol. 46, No. 5, 1999, pp. 667-683.
2. L. Barriére, P. Fraigniaud, E. Kranakis and D. Krizanc. "Efficient routing in networks with long range contacts". 15th International Symposium on Distributed Computing (DISC '01), Lecture Notes in Computer Science vol. 2180, Springer, 2001 pp. 270-284.
3. A. Fiat and J. Saia. "Censorship resistant peer-to-peer content addressable networks". Proceedings of the 13th ACM-SIAM Symp. on Discrete Algorithms, 2002.
4. S. D. Gribble, E. A. Brewer, J. M. Hellerstein, and D. Culler. "Scalable, distributed data structures for Internet service construction. Proc. Fourth Symposium on Operating System Design and Implementation (OSDI 2000), October 2000.
5. 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". Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 654-663, May 1997.
6. J. Kleinberg. "The small world phenomenon: An algorithmic perspective". Proceedings of the 32nd ACM Symposium on Theory of Computing, May 2000, pp. 163-170. (A shorter version available as "Navigation in a Small World", Nature 406, August 2000, pp. 845.)
7. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells and B. Zhao. "OceanStore: An Architecture for Global-Scale Persistent Storage", Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000.
8. N. Lynch, D. Malkhi and D. Ratajczak. "Atomic Data Access in Distributed Hash Tables", Proceedings of the International Peer-to-Peer Symposium, March 2002.
9. T. Lai and D. Wood. "Adaptive heuristics for binary search trees and constant linkage cost". Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, pp. 72-77, San Francisco, CA, 1991.
10. M.-J. Lin, K. Marzullo and S. Masini, "Gossip versus Deterministically Constrained Flooding on Small Networks", Proceedings of the 14th International Conference on Distributed Computing, 2000, pp. 253-267.
11. R. J. Lipton and J. F. Naughton. "Clocked adversaries for hashing". Algorithmica, 9(3), 1993, pp. 239-252.
12. W. Litwin, M.A. Neimat, D. A. Schneider. "LH*-A scalable, distributed data structure", ACM Transactions on Database Systems, Vol. 21(4), 1996, pp. 480-525.
13. R. Motwani and P. Raghavan. "Randomized Algorithms". Cambridge University Press, 1995.
14. T. Ottmann and D. Wood. "Updating binary trees with constant linkage cost". International Journal of Foundations of Computer Science, 3, 1992, pp. 479-501.
15. G. Pandurangan, P. Raghavan and E. Upfal. "Building low-diameter p2p networks".Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 2001.
16. C. Plaxton, R. Rajaram, and A. Richa, "Accessing nearby copies of replicated objects in a distributed environment", Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 97), pp. 311-320, June 1997.
17. W. Pugh. "Skip Lists: A probabilistic alternative to balanced trees". Communications of the ACM, vol 33(6), pp. 668-676, 1990.
18. S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker. "A scalable content-addressable network". Proceedings of the ACM SIGCOMM 2001 Technical Conference. August 2001.
19. H. J. Siegel. "Interconnection networks for SIMD machines". Computer 12(6):57-65, 1979.
20. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. "Chord: A scalable peer-to-peer lookup service for Internet applications". Proceedings of the SIGCOMM 2001, August 2001.
21. B. Y. Zhao, J. D. Kubiatowicz and A. D. Joseph. "Tapestry: An infrastructure for fault-tolerant wide-area location and routing". U. C. Berkeley Technical Report UCB/CSD-01-1141, April, 2001.