Probabilistic quorums for dynamic systems

Distributed Computing

Volumn 18, Issue 2, 2005, Pages 113-124

  Abraham, Ittai ^a   Malkhi, Dahlia ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Dynamic system; Overlay network; Probabilistic quorums; Quorums

Indexed keywords

DYNAMIC SYSTEMS; OVERLAY NETWORKS; PROBABILISTIC QUORUMS; QUORUMS;

ALGORITHMS; MATHEMATICAL TECHNIQUES; PROBABILISTIC LOGICS;

SET THEORY;

EID: 27844459046     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-005-0139-2     Document Type: Conference Paper

References (40)

1. Abraham, I., Awerbuch, B., Azar, Y., Bartal, Y., Malkhi, D., Pavlov, E.: A generic scheme for building overlay networks in adversarial scenarios. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2003) (2003)
2. Abraham, I., Dolev, D.: Asynchronous resource discovery. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003) (2003)
3. Abraham, I., Malkhi, D.: Probabilistic quorums for dynamic systems. In: Proceedings of the 17th International Symposium on DIStributed Computing (DISC 2003) (2003)
4. Sangeeta, B.: Randomized location service in mobile ad hoc networks. In: MSWIM '03: Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems, pp 66-73. ACM Press (2003)
5. Birman, K.P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 41-88 (1999)
6. Castro, M., Druschel, P., Kermarrec, A-M., Nandi, A., Rowstron, A., Singh, A.: Splitstream: High-bandwidth multicast in a cooperative environment. In: SOSP'03 (2003)
7. Chockler, G., Malkhi, D., Merimovich, B., Rabinowitz, D.: Aquarius: A data-centric approach to corba fault-tolerance. In The workshop on Reliable and Secure Middleware, in Proceedings of the 2003 International Conference on Distributed Objects and Applications (DOA) (2003)
8. de Bruijn, N.G.: A combinatorial problem. Konink. Nederl. Akad. Wetersh. Verh. Afd. Natuurk. Eerste Reelss. (A49), 758-764 (1946)
9. Dolev, S., Gilbert, S., Lynch, N., Shvartsman, A., Welch, J.: Geoquorums: Implementing atomic memory in mobile ad hoc networks. In: Proceedings of the 17th International Symposium on Distributed Computing (DISC 2003)
10. Feller, W.: An Introduction to Probability Theory and Its Applications, vol 1. John Wiley & Sons, 3rd edition (1967)
11. Fraigniaud, P., Gauron, P.: The content-addressable network D2B. Technical Report 1349, LRI, Univ. Paris-Sud, France (2003)
12. Garcia-Molina, H., Barbara, D.: How to assign votes in a distributed system. J. ACM. 32(4), 841-860 (1985)
13. Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the 7th ACM Symposium on Operating Systems Principles pp 150-162 (1979)
14. Welch, J.L., Lee, H., Vaidya, N.H.: Location tracking with quorums in mobile ad hoc networks. Ad Hoc Networks. 1(4), 371-381 (2003)
15. Haas, Z.J., Liang, B.: Ad hoc mobility management with randomized database groups. In: Proceedings of the IEEE Internation Conference on Communications (1999)
16. Haas, Z.J., Liang, B.: Ad hoc mobility management with uniform quorum systems. IEEE/ACM Transactions on Networking. 7(2), 228-240 (1999)
17. Harchol-Balter, M., Leighton, T., Lewin, D.: Resource discovery in distributed networks. In: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, pp 229-237 (1999)
18. Harren, M., Hellerstein, J., Huebsch, R., Loo, B. Shenker, S., Stoica, I.: Complex queries in DHT-based peer-to-peer networks. In: Proceedings of 1st International Workshop on Peer-to-Peer Systems (IPTPS'02) (2002)
19. Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. American Statistical Association. 58(301), 13-30 (1963)
20. Kaashoek, F., Karger, D.R.: Koorde: A simple degree-optimal hash table. In: 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03) (2003)
21. Kermarrec, A.-M., Massouli, L., Ganesh, A.J.: Probabilistic reliable dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed Systems. 14(3) (2003)
22. Lee, H., Welch, J.L.: Applications of probabilistic quorums to iterative algorithms. In Proceedings of 21st International Conference on Distributed Computing Systems (ICDCS-21) pp. 21-28 2001)
23. Lee, H., Welch, J.L.: Randomized shared queues. In: Brief announcement in Twentieth ACM Symposium on Principles of Distributed Computing (PODC 2001) (2001)
24. Kermarrec, A.-M., Castro, M., Druschel, P., Rowstron, A.: Scribe: A large-scale and decentralised application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC) (Special issue on Network Support for Multicast Communications) (2002)
25. Maekawa, M.: A √n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3(2), 145-159 (1985)
26. Malkhi, D.: Quorum systems, 1999. Invited chapter in the Encyclopedia of Distributed Computing, Joseph Urban and Partha Dasgupta, editors, Kluwer Academic Publishers, available from http://research.microsoft.com/~dalia/pubs/qu orums.ps
27. Malkhi, D., Reiter, M.: Byzantine quorum systems. Distributed Computing. 11(4), 203-213 (1998)
28. Malkhi, D., Reiter, M.: An architecture for survivable coordination in large distributed systems. IEEE Transactions on Knowledge and Data Engineering. 12(2), 187-202 (2000)
29. Malkhi, D., Reiter, M., Wool, A., Wright, R.: Probabilistic quorum systems. Information and Computation 170(2), 184-206 (2001)
30. Naor, M., Wieder, U.: Novel architectures for p2p applications: the continuous-discrete approach. In: The Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '03) (2003)
31. Naor, M., Wieder, U.: Scalable and dynamic quorum systems. In: proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003) (2003)
32. Naor, M., Wool, A.: The load, capacity and availability of quorum systems. SIAM J. Computing. 27(2), 423-447 (1998)
33. Ratajczak, D.: Decentralized dynamic networks. Technical Report M. Eng. Thesis Proposal, MIT. (2000)
34. Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329-350 (2001)
35. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the SIGCOMM 2001 (2001)
36. Stojmenovic, I.: A scalable quorum based location update scheme for routing in ad hoc wireless networks. Technical Report TR-99-09, SITE, University of Ottawa (1999)
37. Tchakarov, J., Vaidya, N.: Efficient content location in wireless ad hoc networks. In: IEEE International Conference on Mobile Data Management (MDM) (2004)
38. Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems. 4(2), 180-209 (1979)
39. Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications (2003)
40. Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R.H., Kubiatowicz, J.: Bayeux: An architecture for scalable and fault-tolerant widearea data dissemination. In: Proceedings of the Eleventh International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV 2001) (2001)