Paper Info
Title
Achieving High Availability of Consistent Data in the Presence of Network Partitions
Abstract
We discuss availability maximization of a networked service that provides data access in a consistent and reliable manner. Majority voting is a common mechanism that implements such a service in the presence of network partitioning. A distinguishing feature of majority voting is that its availability is tunable by means of vote assignment to server nodes. We argue that achieving maximum availability of a voting-based service requires a powerful combinatorial optimization solving method and a new model of networks that can account for failure-repair behaviors observed in real networks. We suggest that the use of SAT/SMT-based optimization solving is a reasonable approach to combinatorial optimization of our interest. We also suggest the possible directions of augmentation of network reliability models.
Year
DOI
Venue
2012
10.1109/UIC-ATC.2012.127
UIC/ATC
Keywords
Field
DocType
network reliability model,availability maximization,real network,voting-based service,networked service,smt-based optimization,consistent data,powerful combinatorial optimization,network partitions,achieving high availability,maximum availability,majority voting,network partitioning,linear programming,availability,communication networks,computability,servers,data integrity,web services,optimization
Network partition,Telecommunications network,Voting,Computer science,Server,Computer network,Theoretical computer science,Combinatorial optimization,Majority rule,High availability,Maximization,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
8
Authors
1
Name
Order
Citations
PageRank
Tatsuhiro Tsuchiya145552.76