Abstract
Data replication is playing a vital role in the design of distributed information systems. This paper presents a novel and efficient distributed algorithm for managing replicated data and for better performance and availability. This paper presents an extension to existing wheel protocol for improved performance. Wheel protocol imposes a logical wheel structure on the set of copies of an object and gives smallest read quorum. In addition to small read quorum size for read intensive applications, it is necessary to have good write availability as well. This paper proposes two hybrid wheel protocols, which superimpose logarithmic and ring protocols on top of the wheel protocol. It shows that, both protocols help in improving write availability, read capacity, load and message overhead and also compare their performances with wheel and other protocols. Hybrid protocols expand usage of wheel protocol to different type of applications.
Similar content being viewed by others
References
J. Gray, P. Helland, P. O’Neil, D. Shasha, The dangers of replication and a solution, in Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, SIGMOD ‘96, vol. 25, 173(182), New York, NY, USA, June 1996
A. Kumar, Hierarchical quorum consensus: a new algorithm for managing replicated data. IEEE Transactions on Computers, 40(9), 996–1004 (1991)
A. Wai-Chee Fu, Y.S. Wong, M.H. Wong, Diamond quorum consensus for high capacity and efficiency in a replicated database system. Distrib. Parallel Databases 8, 471–492 (2000)
N.C. Mendona, R.O. Anido, The hierarchical ring protocol: an efficient scheme for reading replicated data. Technical Report DCC-93-02, Department of Computer Science, University of Campinas, 30 February 1993
C. Yao-Jen, A triangular-mesh-based approach to fault-tolerant distributed mutual exclusion, Master’s Thesis, National Sun Yat-sen University, June 1995
S.Y. Cheung, M.H. Ammer, M. Ahamad, The grid protocol: a high performance scheme for maintaining replicated data. IEEE Trans. Knowl. Data Eng. 4(6), 582–592 (1992)
P. Pandey, M. Tripathi, Message overhead analysis of quorum protocol, in Proceedings of International Conference on Advances in Computing, vol. 174, pp. 237–245, 2012
P. Pandey, M. Tripathi, The wheel quorum protocol: An efficient approach for reading replicated data. Int. J. Comput. Appl. (2014). doi:10.2316/Journal.202.2014.2.202-3946
P. Pandey, M. Tripathi, A novel quorum protocol for improved performance, in Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), PDPTA’14,84-90, 1-60132-284-4, PDPTA 2014
D. Agrawal, A. E. Abbadi, The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data, in Proceedings of the 16th International Conference on Very Large Data Bases, VLDB ’90 (Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1990), pp. 243–254
D. Agrawa, A. El Abbadi, The generalized tree quorum protocol: an efficient approach for managing replicated data. ACM Trans. Database Syst. 17, 689–717 (1992)
R.H. Thomas, A Majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst. 4(2), 180–209 (1979)
S. Jajodia, D. Mutchler, Dynamic voting, in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 227–238, June 1987
H. Gifford, Weighted voting for replicated data, in Proceedings of 7th Symposium on operating Systems (ACM, 1979), pp. 150–162
M. Maekawa, A sqrt(N) algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2), 145–159 (1985)
D. Agrawal, A. El Abbadi, An efficient solution to the distributed mutual exclusion problem, in Proceedings of the Eighth ACM Symposium on Principles of Distributed Computing, pp. 193–200, August 1989
D. Agrawal, A. El Abbadi, Exploiting logical structures in replicated databases. Inf. Process. Lett. 33, 255–260 (1990)
C. Storm, T. Warns, O. Theel, Flexible heterogeneous strict quorum-based dynamic data replication schemes, in Proceedings of the 2008 14th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC ’08 (IEEE Computer Society, Washington, DC, USA, 2008), pp. 200–207
P. Pandey, M. Tripathi, Exploiting logical structures to reduce quorum sizes of replicated databases. Adv. Comput. Int. J. 3, 99–104 (2012)
R. Jiménez-Peris, M. Patiño-Martínez, G. Alonso, B. Kemme, Are quorums an alternative for data replication? ACM Trans. Database Syst. 28(3), 257–294 (2003). doi:10.1145/937598.937601
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pandey, P., Tripathi, M. A Hybrid Quorum Protocol for Improved Availability, Capacity, Load and Reduced Overhead. J. Inst. Eng. India Ser. B 97, 437–444 (2016). https://doi.org/10.1007/s40031-016-0245-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40031-016-0245-5