File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Optimal Termination Protocols for Network Partitioning

TitleOptimal Termination Protocols for Network Partitioning
Authors
Chin, FrancisRamarao, KVS
Issue Date1986
PublisherSociety for Industrial and Applied Mathematics. The Journal's web site is located at http://www.siam.org/journals/sicomp.php
Citation
SIAM Journal On Computing, 1986, v. 15 n. 1, p. 131-144 How to Cite?
DOI: http://dx.doi.org/10.1137/0215010
AbstractWe 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.
Persistent Identifierhttp://hdl.handle.net/10722/152219
ISSN
0097-5397
2023 Impact Factor: 1.2
2023 SCImago Journal Rankings: 2.143
ISI Accession Number ID
WOS:A1986AZH0100010

 

DC FieldValueLanguage
dc.contributor.authorChin, Francisen_US
dc.contributor.authorRamarao, KVSen_US
dc.date.accessioned2012-06-26T06:36:36Z-
dc.date.available2012-06-26T06:36:36Z-
dc.date.issued1986en_US
dc.identifier.citationSIAM Journal On Computing, 1986, v. 15 n. 1, p. 131-144en_US
dc.identifier.issn0097-5397en_US
dc.identifier.urihttp://hdl.handle.net/10722/152219-
dc.description.abstractWe 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.en_US
dc.languageengen_US
dc.publisherSociety for Industrial and Applied Mathematics. The Journal's web site is located at http://www.siam.org/journals/sicomp.php-
dc.relation.ispartofSIAM Journal on Computingen_US
dc.rights© 1986 Society for Industrial and Applied Mathematics. First Published in SIAM Journal on Computing in volume 15, issue 1, published by the Society for Industrial and Applied Mathematics (SIAM).-
dc.titleOptimal Termination Protocols for Network Partitioningen_US
dc.typeArticleen_US
dc.identifier.emailChin, Francis:chin@cs.hku.hken_US
dc.identifier.authorityChin, Francis=rp00105en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1137/0215010-
dc.identifier.scopuseid_2-s2.0-0022659652en_US
dc.identifier.volume15en_US
dc.identifier.issue1en_US
dc.identifier.spage131en_US
dc.identifier.epage144en_US
dc.identifier.isiWOS:A1986AZH0100010-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChin, Francis=7005101915en_US
dc.identifier.scopusauthoridRamarao, KVS=6603731930en_US
dc.identifier.issnl0097-5397-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats