Novel architectures for P2P applications: The continuous-discrete approach

ACM Transactions on Algorithms

Volumn 3, Issue 3, 2007, Pages

  Naor, Moni ^a   Wieder, Udi ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Peer to peer networks; Routing

Indexed keywords

BUFFER STORAGE; CONTINUOUS TIME SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; ROUTING PROTOCOLS;

DISTRIBUTED HASH TABLE (DHT); DYNAMIC CACHING; PEER-TO-PEER NETWORKS;

NETWORK ARCHITECTURE;

EID: 34548290258     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1273340.1273350     Document Type: Article

References (49)

1. ABRAHAM, I., AWERBUCH, B., AZAR, Y., BARTAL, Y., MALKHI, D., AND PAVLOV, E. 2003. A generic scheme for building overlay networks in adversarial scenarios. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS). 40.
2. AIELLO, W., AWERBUCH, B., MAGGS, B. M., AND RAO, S. 1993. Approximate load balancing on dynamic and asynchronous networks. In Proceedings of the ACM Symposium on Theory of Computing. 632-641.
3. ALON, N., AND SPENCER, J. H. 2000. The Probabilistic Method, 2nd ed. John Wiley & Sons.
4. ASPNES, J., AND WIEDER, U. 2005. The expansion and mixing time of skip graphs with applications. In Proceedings of the Symposium on Parallelism in Algorithms and Architectures (SPAA). 126-134.
5. BYERS, J. W., LUBY, M., MITZENMACHER, M., AND REGE, A. 1998. A digital fountain approach to reliable distribution of bulk data. In Proceedings of the ACM SIGCOMM Data Communications Festival. 56-67.
6. CAI, J. 2003. Essentially every unimodular matrix defines an expander. Theory Comput. Syst. 36, 2, 105-135.
7. CHANKHUNTHOD, A., DANZIG, P. B., NEERDAELS, C., SCHWARTZ, M. F, AND WORRELL, K. J. 1996. A hierarchical Internet object cache. In Proceedings of the USENIX Annual Technical Conference. 153-163.
8. COHEN, E., AND KAPLAN, H. 2002. Balanced-Replication algorithms for distribution trees. In Proceedings of the European Symposium on Algorithms (ESA). 297-309.
9. DIKS, K., AND PELC, A. 2000. Optimal adaptive broadcasting with a bounded fraction of faulty nodes. Algorithmica 28, 1, 36-50.
10. DUBHASHI, D. P., AND PANCONESI, A. 2005. Concentration of Measure for the Analysis of Randomised Algorithms. Book draft.
11. FIAT, A., AND SAIA, J. 2002. Censorship resistant peer-to-peer content addressable networks. In Proceedings of the Symposium on Discrete Algorithms (SODA). 94-103.
12. FRAIGNIAUD, P., AND GAURON, P. 2003. An overview of the content-addressable network d2b. In Proceedings of the Symposium on Principles of Distributed Computing (PODC). 151.
13. FRIEDMAN, J. 2003. A proof of Alon's second eigenvalue conjecture. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). 720-724.
14. GABBER, O., AND GALIL, Z. 1981. Explicit construction of linear-sized superconcentrators. J. Comput. Syst. Sci. 22, 407-420.
15. GKANTSIDIS, C., MIHAIL, M., AND SABERI, A. 2004. Random walks in peer-to-peer networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM).
16. HILDRUM, K., AND KUBIATOWICZ, J. 2003. Asymptotically efficient approaches to fault-tolerance in peer-to-peernetworks. In Proceedings of the International Symposium on Distributed Computing (DISC). 321-336.
17. HOROWITZ, K., AND MALKHI, D. 2003. Estimating network size from local information. Inf. Process. Lett. 88, 5, 237-243.
18. KAASHOEK, M. F., AND KARGER, D. R. 2003. Koorde: A simple degree-optimal distributed hash table. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS). 98-107.
19. KARGER, D., LEHMAN, E., LEIGHTON, F. T., PANIGRAHY, R., LEVINE, M., AND LEWIN, D. 1997. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the ACM Symposium on Theory of Computing. 654-663.
20. KARGER, D. R., AND RUHL, M. 2004. Simple efficient load balancing algorithms for peer-to-peer systems. In Proceedings of the ACM Symposium on Parallelism in Algorithm and Architectures (SPAA). 36-43.
21. KENTHAPADI, K., AND MANKU, G. S. 2005. Decentralized algorithms using both local and random probes for p2p load balancing. In Proceedings of the 7th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 135-144.
22. KLEINBERG, J. 2000. The small-world phenomenon: An algorithmic perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing. 163-170.
23. KOCH, R. R., LEIGHTON, F. T., MAGGS, B. M., RAO, S., ROSENBERG, A. L., AND SCHWABE, E. J. 1997. Work-Preserving emulations of fixed-connection networks. J. ACM 44, 1 (Jan.), 104-147.
24. p). Int. Math. Res. Not. 27, 1465-1471.
25. LAW, C., AND SIU, K.-Y. 2003. Distributed construction of random expander graphs. In Proceedings of the Annual Joint Conference of the IEEE Computer Communications Societies (INFOCOM).
26. LEIGHTON, F. T. 1992. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, CA.
27. LEIGHTON, F. T., AND MAGGS, B. 1989. Expanders might be practical: Fast algorithms for routing around faults in multibutterflies. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS). 384-389.
28. MAGGS, B. M., AND SCHWABE, E. J. 1998. Real-Time emulations of bounded-degree networks. Inf. Process. Lett. 66, 5, 269-276.
29. MALKHI, D., NAOR, M., AND RATAJCZAK, D. 2002. Viceroy: A scalable and dynamic emulation of the butterfly. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). 183-192.
30. MANKU, G. S. 2004. Balanced binary trees for id management and load balance in distributed hash tables. In Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, (PODC). 197-205.
31. MARGULIS, G. A. 1973. Explicit constructions of concentrators. Problemy Peredachi Inf. 9, 4 (Oct.-Dec).
32. MAYMOUNKOV, P., AND MAZIÈRES, D. 2002. Kademlia: A peer-to-peer information system based on the XOR metric. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS). 53-65.
33. MITZENMACHER, M., RICHA, A., AND SITARAMAN, R. 2000. The power of two random choices: A survey of the techniques and results. In Handbook of Randomized Computing, P. Pardalos et al., eds. Kluwer, Hingham, MA.
34. MITZENMACHER, M., RICHA, A., AND SITARAMAN, R. 2000. The power of two random choices: A survey of the techniques and results. In Handbook of Randomized Computing, P. Pardalos et al., eds. Kluwer, Hingham, MA.
35. NADAV, U., AND NAOR, M. 2004. Fault-Tolerant storage in a dynamic environment. In Proceedings of the International Symposium on Distributed Computing (DISC). 390-404.
36. NAOR, M., AND WIEDER, U. 2005. Scalable and dynamic quorum systems. Distrib. Comput. Prelimenary version appeared. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC) 17, 4, 311-322.
37. NAOR, M., AND WIEDER, U. 2003a. Novel architectures for p2p applications: The continuous-discrete approach. In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 50-59.
38. NAOR, M., AND WIEDER, U. 2003b. A simple fault tolerant distributed hash table. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems. 88-97.
39. OKABE, A., BOOTS, B., SUGIHARA, K., AND CHIU, S. N. 2000. Spatial Tessellations - Concepts and Applications of Voronoi Diagrams, 2nd ed. Wiley, Chichester, UK.
40. PLAXTON, C. G., AND RAJARAMAN, R. 1996. Fast fault-tolerant concurrent access to shared objects. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 570-579.
41. RANADE, A. G. 1991. How to emulate shared memory. J. Comput. Syst. Sci. 42, 3, 307-326.
42. RATNASAMY, S., SHENKER, S., AND STOICA, I. 2002. Routing algorithms for dhts: Some open questions. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS). 45-52.
43. RATNASAMY, S., FRANCIS, P., HANDLEY, M., KARP, R., AND SHENKER, S. 2001. A scalable content addressable network. In Proceedings of the ACM SIGCOMM Data Communication Festival, (San Diego CA). 161-172.
44. ROWSTRON, A., AND DRUSCHEL, P. 2001. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proceedings of the IEEE ACM International Conference on Distributed Systems Platforms. Lecture Notes in Computer Science, vol. 2218, Springer, 329-350.
45. SAIA, J., FIAT, A., GRIBBLE, S., KARLIN, A. R., AND SAROIU, S. 2002. Dynamically fault-tolerant content addressable networks. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS). 270-279.
46. STOICA, I., MORRIS, R., KARGER, D., KAASHOEK, M. F., AND BALAKRISHNAN, H. 2001. Chord: A scalable Peer-To-Peer lookup service for Internet applications. In Proceedings of the ACM SIGCOMM Data Communication Festival. 149-160.
47. VALIANT, L. G. 1982. A scheme for fast parallel communication. SIAM J. Comput. 11, 2 (May), 350-361.
48. WEATHERSPOON, H., AND KUBIATOWICZ, J. 2002. Erasure coding vs. replication: A quantitative comparison. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS). 328-338.
49. ZHAO, B. Y., AND KUBIATOWICZ, J. 2001. Tapestry: An infrastructure forfault-tolerant wide-area location and routing. Tech. Rep. UCB CSD 01-1141, University of California at Berkeley, Computer Science Department.