Obtaining Optimal Coteries that Maximize Availability in General Topology Networks

@inproceedings{Tsuchiya2008ObtainingOC,
  title={Obtaining Optimal Coteries that Maximize Availability in General Topology Networks},
  author={Tatsuhiro Tsuchiya},
  year={2008}
}
We discuss availability optimization of quorum-based mutual exclusion mechanisms in unreliable networks. The availability of such a mechanism depends critically on the coterie (a set of node groups called quorums) that the mechanism adopts. Previously, an integerprogramming approach was proposed for obtaining optimal coteries that maximize availability. However, this approach cannot be applied to networks with arbitrary topology, because there has been no method that computes the probability… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

Obtaining Coteries That Optimize the Availability of Replicated Databases

  • IEEE Trans. Knowl. Data Eng.
  • 1993
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Design and Evaluation of Coteries for Distributed Mutual Exclusion

T. Tsuchiya
  • Ph.D. dissertation, Osaka University,
  • 1998
VIEW 1 EXCERPT

Maximizing availability of quorum-based exclusion mechanisms

T. Tsuchiya, T. Kikuno
  • Digest of FastAbstracts: FTCS-28 (the 28th International Symposium on Fault- Tolerant Computing), pp.92-93, June 1998.
  • 1998
VIEW 1 EXCERPT

Nondominated Coteries on Graphs

  • IEEE Trans. Parallel Distrib. Syst.
  • 1997
VIEW 1 EXCERPT

A Taxonomy of Distributed Mutual Exclusion

  • J. Parallel Distrib. Comput.
  • 1993
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…