Probabilistic quorums for dynamic systems: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2848, Issue , 2003, Pages 60-74

  Abraham, Ittai ^a   Malkhi, Dahlia ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; DYNAMIC MODELS; NETWORK MANAGEMENT;

ARBITRARY CHANGE; BUILDING BLOCKES; CONSISTENCY RESULT; DYNAMIC SETTINGS; EXTENDED ABSTRACTS; PROBABILISTIC QUORUMS; QUORUM SYSTEMS; SHARED INFORMATION;

PROBABILITY DISTRIBUTIONS;

EID: 35248858413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39989-6_5     Document Type: Article

References (24)

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 International Parallel and Distributed Processing Symposium (IPDPS 2003), April 2003, Nice, France.
2. I. Abraham, D. Dolev. Asynchronous Resource Discovery. In proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003). June 2003.
3. I. Abraham and D. Malkhi. Probabilistic Quorums for Dynamic Systems. Leibnitz Center TR 2003-32, School of Computer Science and Engineering, The Hebrew University, June 2003. http://leibniz.cs.huji.ac.il/tr/acc/2003/ HUJI-CSE-LTR-2003-32_dpq11.ps
4. M. Adler, E. Halperin, R. Karp and V. Vazirani. A stochastic process on the hypercube with applications to peer to peer networks. In The 35th Annual ACM Symposium on Theory of Computing (STOC), 2003.
5. N. G. de Bruijn. A combinatorial problem, Konink. Nederl. Akad. Wetersh. Verh. Afd. Natuurk. Berste Reelss, A49 (1946), pp. 758-764.
6. W. Feller. An Introduction to Probability Theory and Its Applications, volume 1. John Wiley & Sons, New York, 3rd edition, 1967.
7. A. Fiat and J. Saia. Censorship resistant peer-to-peer content addressable networks. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, 2002.
8. P. Fraigniaud and P. Gauron. The Content-Addressable Network D2B. Technical Report 1349, LRI, Univ. Paris-Sud, France, January 2003.
9. http://gnutella.wego.com.
10. Z. J. Haas and B. Liang. Ad hoc mobility management with randomized database groups. In Proceedings of the IEEE Internation Conference on Communications, June 1999.
11. M. Harchol-Balter, T. Leighton, and D. Lewin. Resource Discovery in Distributed Networks. In Proc. 15th ACM Symp. on Principles of Distributed Computing, May 1999, pp. 229-237.
12. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301):13-30, 1963.
13. F. Kaashoek and D. R. Karger. Koorde: A Simple Degree-optimal Hash Table. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), February 2003, Berkeley, CA.
14. H. Lee and J. L. Welch. Applications of Probabilistic Quorums to Iterative Algorithms. In Proceedings of 21st International Conference on Distributed Computing Systems (ICDCS-21), Pages 21-28. April, 2001.
15. H. Lee and J. L. Welch. Randomized Shared Queues. Brief announcement in Twentieth ACM Symposium on Principles of Distributed Computing (PODC 2001).
16. D. Malkhi, M. Reiter. Secure and Scalable Replication in Phalanx. Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems (SRDS '98), October 1998, Purdue University, West Lafayette, Indiana, pages 51-60.
17. D. Malkhi and M. Reiter. An Architecture for Survivable Coordination in Large Distributed Systems. IEEE Transactions on Knowledge and Data Engineering, 12(2):187-202, April 2000.
18. D. Malkhi, M. Reiter, A. Wool and R. Wright. Probabilistic quorum systems. The Information and Computation Journal 170(2):184-206, November 2001.
19. M. Naor and U. Weider. Novel architectures for P2P applications: the continuous-discrete approach. In proceedings pf Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2003), June 2003.
20. M. Naor and U. Wieder. Scalable and Dynamic Quorum Systems. In proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), June 2003.
21. M. Naor and A. Wool. The load, capacity and availability of quorum systems. SIAM Journal of Computing, 27(2):423-447, April 1998.
22. G. Pandurangan, P. Raghavan and E. Upfal. Building low-diameter p2p networks. In Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 2001.
23. D. Rataczjak. Decentralized Dynamic Networks. M. Eng. Thesis Proposal, MIT, May 2000.
24. J. Saia, A. Fiat, S. Gribble, A. Karlin, and S. Saroiu. Dynamically Fault-Tolerant Content Addressable Networks, In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), March 2002, Cambridge, MA USA