M.Naor and A.Wool, The load capacity and availability of quorum systems, SIAM J. on Computing, April 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A New Matching Algorithm for Managing Location Information in.. - Kumar, Camp (2000) (Correct)
....are only slightly larger than the quorums for the CAA grid protocol, and smaller than the quorums for CWLog. 4. 3 Load Analysis A standard definition of load in a quorum system is the probability with which the busiest server is accessed under the best possible strategy for accessing quorums [12,14]. For example, if the size of a quorum is a majority, then the load is 0.5; each quorum consists of half the total number of vertices. Therefore, even under the best strategy for load distribution, each vertex participates in half of the quorums. Table 2: Comparing average quorum sizes. Read ....
M. Naor and A. Wool, "The load, capacity and availability of quorum systems," Proceedings of the 35 IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 214-225, 1994.
Using Hysteresis to Reduce Adaptation Cost of a Dynamic Quorum.. - Bearden (Correct)
....quorum mapping function that is best for a given application of quorums. This choice can be based on a number of quorum system metrics that predict the cost and performance of quorum assignments. Traditional metrics include the quorum size, quorum load, and quorum availability metrics discussed in [21,27]. Quorum size is the number of processors in each quorum; load is the number of quorums a processor is contained in; and availability is the probability that all members of a quorum are simultaneously not faulty. The quorum size, load, and availability metrics are not alone sufficient for ....
Naor, M. and Wool, A., "The Load, Capacity, and Availability of Quorum Systems," Proc. 35th Annual Symp. on Foundations of Computer Science, Santa Fe, New Mexico, Nov. 1994, pp. 214-215. An expanded version is to appear in SIAM Journal of Computing.
Enhancing Survivability of Mobile Internet Access Using.. - Ravi Jain Thomas (1999) (2 citations) (Correct)
....since it basically replaces the query TS( routine. The Binding Cache and the HLR List cache are still maintained. We omit further details. Figure 2: Triangle Lattice (TL) system for d = 5 Figure 3: Timing diagram illustrating Optimistic TL Quorum algorithms are evaluated using several criteria [15]. The quorum size, defined as the size of the smallest quorum in the system, determines the cost of accessing the members of the quorum. The cost of failures is the additional number of processors that must be contacted in order to establish a quorum when failures occur. For Basic QC algorithm, ....
Naor, M. and A. Wool, " The load, capacity and availability of quorum systems," Proc. IEEE Symp. Foundations of Computer Science, 214-225, 1994.
Fault-Tolerant Storage in a Dynamic Environment - Nadav, Naor (2004) Self-citation (Naor) (Correct)
No context found.
M.Naor and A.Wool, The load capacity and availability of quorum systems, SIAM J. on Computing, April 1998.
Distributed Pseudo-Random Functions and KDCs - Naor, Pinkas, Reingold (1999) (20 citations) Self-citation (Naor) (Correct)
....servers in parallel. We also support DPRFs based on general monotone access structures [7, 28, 3] rather than on threshold ones. There are several scenarios where general access structures might be preferable to threshold access structures (e.g. to allow efficient implementations of quorum systems [38] which enable fast revocation) Our constructions can be further amended to be robust against servers which USERS SERVERS User 3 User 2 User 1 Fig. 1. A Distributed Pseudo Random Function System. send incorrect data to users who approach them, the robustness is based either on error correcting ....
....f(h) should provide it with the values fP e (h) j (e) ig. If the user receives information from a privileged subset it can sum the values that correspond to a path from s to t and get P s (h) Quorum systems: A Quorum system is a collection of sets (quorums) every two of which intersect (see [38] for a discussion and some novel constructions of quorum systems with optimal load and high availability) A DPRF with an access structure in which every privileged set must contain a quorum has several advantages regarding its maintenance: for example, if a user should not be allowed to compute f ....
[Article contains additional citation context not shown here]
Naor M. and Wool A., "The load, capacity, and availability of quorum systems", SIAM J. Comput., Vol. 27, No. 2, 423-447, April 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC