Download:
|
by Ittai Abraham, Dahlia Malkhi
In DISC
http://www.cs.huji.ac.il/labs/danss/papers/2003/disc2.ps
Add To MetaCart
Abstract:
Abstract. A quorum system is a set of sets such that every two sets in the quorum system intersect. Quorum systems may be used as a building block for performing updates and global queries on a distributed, shared information base. An "-intersecting quorum system is a distribution on sets such that every two sets from the distribution intersect with probability 1 ". This relaxation of consistency results in a dramatic improvement of the load balancing and resilience of quorum systems, making the approach especially attractive for scalable and dynamic settings. In this paper we assume a dynamic model where nodes constantly join and leave the system. A quorum chosen at time s must evolve and transform as the system grows/shrinks in order to remain viable. For such a dynamic model, we introduce dynamic "-intersecting quorum systems. A dynamic "-intersecting quorum system ensures that in spite of arbitrary changes in the system population, any two evolved quorums intersect with probability 1 ". 1
Citations
|
979
|
An introduction to probability theory and its application, volume I
– Feller
- 1967
|
|
284
|
Byzantine quorum systems
– Malkhi, Reiter
- 1998
|
|
122
|
Probability inequalities for sums of bounded random variables
– Hoeding
- 1963
|
|
102
|
Novel Architectures for P2P Applications: the Continuous-Discrete Approach
– Naor, Wieder
- 2003
|
|
84
|
Building low-diameter p2p networks
– Pandurangan, Raghavan, et al.
|
|
68
|
Secure and scalable replication in phalanx
– Malkhi, Reiter
- 1998
|
|
67
|
Koorde: A simple degree-optimal hash table
– Kaashoek, Karger
- 2003
|
|
63
|
Resource Discovery in Distributed Networks
– Harchol-Balter, Leighton, et al.
- 1999
|
|
62
|
A.: The load, capacity, and availability of quorum systems
– Naor, Wool
- 1998
|
|
43
|
Censorship resistant peer-to-peer content addressable networks
– Fiat, Saia
- 2002
|
|
43
|
An architecture for survivable coordination in large distrusted systems
– Malkhi, Reiter
|
|
41
|
Dynamically fault-tolerant content addressable networks
– Saia, Fiat, et al.
- 2002
|
|
39
|
The ContentAddressable Network D2B
– Fraigniaud, Gauron
- 2003
|
|
34
|
A stochastic process on the hypercube with applications to peer-to-peer networks
– Adler, Halperin, et al.
|
|
31
|
A Generic Scheme for Building Overlay Networks
– Abraham, Awerbuch, et al.
|
|
18
|
Ad hoc mobility management with randomized database groups
– Haas, Liang
- 1999
|
|
18
|
Scalable and Dynamic Quorum Systems
– Naor, Wieder
|
|
13
|
de Bruijn. A combinatorial problem, Konink
– G
- 1946
|
|
10
|
Asynchronous Resource Discovery
– Abraham, Dolev
- 2003
|
|
5
|
Applications of Probabilistic Quorums to Iterative Algorithms
– Lee, Welch
- 2001
|
|
1
|
Randomized Shared Queues. Brief announcement
– Lee, Welch
- 2001
|
|
1
|
Decentralized Dynamic Networks
– Rataczjak
- 2000
|
|
1
|
Probabilistic Quorums for Dynamic Systems 15
– Abraham, Awerbuch, et al.
- 2003
|
|
1
|
Eerste Reelss, A49
– Natuurk
- 1946
|
|
1
|
3rd edition
– Sons
- 1967
|
