SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Computing / Volume 15 / Issue 1

SIAM J. Comput. 15, pp. 131-144 (14 pages)

Optimal Termination Protocols for Network Partitioning

Francis Chin and K. V. S. Ramarao

Full Text: Download PDF | Buy PDF (US$25) | View Cart
We address the problem of maintaining the distributed database consistency in presence of failures while maximizing the database availability. Network Partitioning is a failure which partitions the distributed system into a number of parts, no part being able to communicate with any other. Formalizations of various notions in this context are developed and two measures for the performances of protocols in presence of a network partitioning are introduced. A general optimality theory is developed for two classes of protocols—centralized and decentralized. Optimal protocols are produced in all cases.

© 1986 © Society for Industrial and Applied Mathematics

KEYWORDS

PUBLICATION DATA

ISSN

0097-5397 (print)  
1095-7111 (online)

Publisher

$abstract.society.value is a Member of CrossRef © Society for Industrial and Applied Mathematics

ARTICLE DATA

History
Received November 29, 1982
Digital Object Identifier
http://dx.doi.org/10.1137/0215010

For access to fully linked references, you need to log in.

For access to citing articles, you need to log in.


Close

Your Recent History Recent History Help

Recently Viewed

  1. Optimal Termination Protocols for Network Partitioning
  2. An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
  3. The Generalized Graetz Problem in Finite Domains
  4. Self-Similar Voiding Solutions of a Single Layered Model of Folding Rocks
  5. Geometry-Driven Charge Accumulation in Electrokinetic Flows between Thin, Closely Spaced Laminates
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close