An Analysis of the Average Message Overhead in Replica Control Protocols
IEEE Transactions on Parallel and Distributed Systems
Data Replication Strategies for Fault Tolerance and Availability on Commodity Clusters
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Group Protocol for Quorum-Based Replication
ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems
The Design and Simulation of a Hybrid Replication Control Protocol
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
Analysis of Read and Write Availability for Generalized Hybrid Data Replication Protocol
PRDC '04 Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)
ACM Computing Surveys (CSUR)
Dynamic Quorums for DHT-based P2P Networks
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
Consistency Management among Replicas Using a Quorum System in Ad Hoc Networks
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Tolerating Byzantine Faulty Clients in a Quorum System
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
ISPDC '06 Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing
Quorum-based consistency management among replicas in ad hoc networks with data update
Proceedings of the 2007 ACM symposium on Applied computing
Availability and Performance of the Adaptive Voting Replication
ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
Minimizing Response Time for Quorum-System Protocols over Wide-Area Networks
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Decentralized managing of replication objects in massively distributed systems
DaMaP '08 Proceedings of the 2008 international workshop on Data management in peer-to-peer systems
Deriving Highly Available Quorum Systems from Structural Failure Models
EDCC-7 '08 Proceedings of the 2008 Seventh European Dependable Computing Conference
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
Cell approximation method in quorum systems for minimizing access time
Cluster Computing
Efficient Hierarchical Quorums in Unstructured Peer-to-Peer Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Quorum based data replication in grid environment
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Replication strategies for highly available peer-to-peer storage
Future directions in distributed computing
Consistency-driven probabilistic quorum system construction for improving operation availability
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Binary vote assignment grid quorum for managing fragmented database
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
MORM: A Multi-objective Optimized Replication Management strategy for cloud storage cluster
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
Effective data management is an important issue in a large-scale distributed environment such as distributed DBMS, Peer-to-Peer System (P2P), data grid, and World Wide Web (WWW). This can be achieved by using a replication protocol, which efficiently decrease the communication cost and increase the data availability. The Tree Quorum protocol is one of the representative replication protocols allowing low read cost in the best case but it has some drawbacks such as that the number of replicas grows rapidly as the level increases and root replica is a bottleneck. The Grid protocol requires fixed operation cost regardless of failure condition. In this paper we propose a new replication protocol called Dynamic Hybrid protocol, which efficiently improves the existing protocols. The proposed protocol effectively combines the grid and tree structure so that the overall topology can be flexibly adjusted using three configuration parameters; tree height, number of descendants and grid depth. For high read availability, the height of tree and number of descendants are decreased and depth of grid is increased. For high write availability, the height of tree and the depth of grid are decreased, while the number of descendant is increased. We present an analytical model of read/write availability and the average number of nodes accessed for each operation. We also employ computer simulation to estimate the throughput and communication overhead. The proposed protocol always allows much smaller communication and operation cost than earlier protocols.