A dynamic majority determination algorithm for reconfiguration of network partitions
Information Sciences: an International Journal
A Pessimistic Consistency Control Algorithm for Replicated Files Which Achieves High Availability
IEEE Transactions on Software Engineering
Stochastic Petri Net Analysis of a Replicated File System
IEEE Transactions on Software Engineering
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
Regeneration with Virtual Copies for Distributed Computing Systems
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
A Fault-Tolerant Algorithm for Replicated Data Management
IEEE Transactions on Parallel and Distributed Systems
A Hybrid Replica Control Algorithm Combining Static and Dynamic Voting
IEEE Transactions on Knowledge and Data Engineering
A New Dynamic Voting Algorithm for Distributed Database Systems
IEEE Transactions on Knowledge and Data Engineering
SPNP: Stochastic Petri Net Package
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
The Effect of Workload on the Performance and Availability of Voting Algorithms
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
COMPSAC '00 24th International Computer Software and Applications Conference
Availability Study of Dynamic Voting Algorithms
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Analyzing reconfigurable algorithms for managing replicated data
Journal of Systems and Software
The obscure nature of epidemic quorum systems
Proceedings of the 9th workshop on Mobile computing systems and applications
A General Approach to Analyzing Quorum-Based Heterogeneous Dynamic Data Replication Schemes
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
A survey of intrusion detection techniques for cyber-physical systems
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Dynamic voting is considered a promising technique for achieving high availability in distributed systems with data replication. To date, stochastic analysis of dynamic voting algorithms is restricted to either site or link Markov models, but not both, possibly because of the difficulty in specifying the state-space which grows exponentially as the number of sites increases. Furthermore, to reduce the state-space, the assumption of "frequent updates" was normally made, which results in an overestimation of the availability. In this paper, we develop a Petri net model that considers both site and link failures and also relaxes the modeling assumption of frequent updates. We test our Petri net model on ring and star network topologies to analyze if availability under dynamic voting can be seriously degraded if updates are not frequent under various site and link failure/repair situations. Finally, We use the Petri net developed in the paper to determine the maximum achievable improvement in availability when null updates are introduced to augment regular updates to keep the status of availability up-to-date.