Novel architectures for P2P applications: The continuous-discrete approach

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 50-59

  Naor, Moni ^a   Wieder, Udi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Algorithms

Indexed keywords

ALGORITHMS; BUFFER STORAGE; PROGRAM PROCESSORS; TOPOLOGY;

DISTRIBUTED HASH TABLE (DHT);

TELECOMMUNICATION NETWORKS;

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

References (28)

1. W. Aiello, B. Awerbuch, B.M. Maggs, and S. Rao. Approximate load balancing on dynamic and asynchronous networks. In ACM Symposium on Theory of Computing, pages 632-641, 1993.
2. N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley & Sons, 2000.
3. A. Chankhunthod, P. B. Danzig, C. Neerdaels, M. F. Schwartz, and K. J. Worrell. A hierarchical Internet object cache. In Proceedings of the USENIX 1996 annual technical conference, pages 153-163.
4. E. Cohen and H. Kaplan. Balanced-replication algorithms for distribution trees. In ESA European Symposium on Algorithms, pages 297-309, 2002.
5. F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan. Building peer-to-peer systems with Chord, a distributed lookup service. In Eighth IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII), pages 81-86.
6. P. Fraigniaud and P. Gauron. The content-addressable network d2b. Technical Report LRI 1349, Univ. Paris-Sud, 2003.
7. O. Gabber and Z. Galil. Explicit construction of linear-sized superconcentrators. Journal of Computer and System Science, 22:407-420, 1981.
8. F. Kaashoek and D. Karger. Koorde, a simple degree-optimal hash table. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003.
9. D. Karger, E. Lehman, F.T. Leighton, R. Panigrahy, M. Levine, and D. Lewin. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In ACM Symposium on Theory of Computing, pages 654-663, 1997.
10. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 163-170, 2000.
11. R. R. Koch, F. T. Leighton, B. M. Maggs, S. B. Rao, A. L. Rosenberg, and E. J. Schwabe. Work-preserving emulations of fixed-connection networks. Journal of the ACM, 44(1):104-147, 1997.
12. Ching Law and Kai-Yeung Siu. Distributed construction of random expander graphs. In INFOCOM, 2003.
13. F. T. Leighton. Introduction to parallel algorithms and architectures: arrays, trees, hypercubes, chapter 3.3. Morgan Kaufmann, San Mateo, CA, 1992.
14. D. Liben-Nowell, H. Balakrishnan, and D. Karger. Analysis of the evolution of peer-to-peer systems. In ACM Conf. on Principles of Distributed Computing (PODC), pages 233-242, 2002.
15. B. M. Maggs and E. J. Schwabe. Real-time emulations of bounded-degree networks. Information Processing Letters, 66(5):269-276, 1998.
16. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In ACM Conf. on Principles of Distributed Computing (PODC), pages 183-192, 2002.
17. D. Malkhi, M. K. Reiter, and R. N. Wright. Probabilistic quorum systems. In Symposium on Principles of Distributed Computing (PODC), pages 267-273, 1997.
18. G. A. Margulis. Explicit constructions of concentrators. Problemy Peredachi Informatsii, (9(4)):325-332, 1973.
19. M. Mitzenmacher, A. Richa, and R. Sitaraman. The power of two random choices: A survey of the techniques and results. In Handbook of Randomized Computing. P. Pardalos, S. Rajasekaran, J. Rolim, and Eds. Kluwer, editors, 2000.
20. M. Naor and U. Wieder. Scalable and dynamic quorum systems. In ACM Conf. on Principles of Distributed Computing (PODC), 2003.
21. M. Naor and U. Wieder. A simple fault tolerant distributed hash table. In Second International Workshop on Peer-to-Peer Systems, February 2003.
22. A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu. Spatial Tessellations - Concepts and Applications of Voronoi Diagrams, Wiley, Chichester, second edition, 2000.
23. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proc ACM SIGCOMM, pages 161-172, 2001.
24. S. Ratnasamy, S. Shenker, and I. Stoica. Routing algorithms for dhts: Some open questions. In First International Workshop on Peer-to-Peer Systems (IPTPS), 2002.
25. Antony Rowstron and Peter Druschel. Pastry: scalable, decentraized object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th ACM International Conference on Distributed Systems Platforms (Middleware), pages 329-350, 2001.
26. 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 the 2001 ACM SIGCOMM, pages 149-160, 2001.
27. L. G. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11(2):350-361, 1982.
28. B.Y. Zhao and J. Kubiatowicz. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB CSD 01-1141, University of California at Berkeley, Computer Science Department, 2001.