The week's pick
Random Articles
Reseach Article
A Primary Shift Protocol for Improving Availability in Replication Systems
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 72 - Number 4 |
| Year of Publication: 2013 |
| Authors: Almetwally M. Mostafa, Ahmed E. Youssef |
10.5120/12485-8905
|
Almetwally M. Mostafa, Ahmed E. Youssef . A Primary Shift Protocol for Improving Availability in Replication Systems. International Journal of Computer Applications. 72, 4 ( June 2013), 37-44. DOI=10.5120/12485-8905
Abstract
Primary Backup Replication (PBR) is the most common technique to achieve availability in distributed systems. However, primary failure remains a crucial problem that threatens availability. When the primary fails, backup nodes in the system have to elect a new primary node in order to maintain adequate system's operation. During election, the system suffers from transaction loss, communication overhead due to messages exchange necessary to preserve data consistency, and a notable delay caused by the execution of Leader Election Algorithms (LEA). Primary failures can be unpredictable (i. e. , unplanned), such as primary node crashes and network outages, or predictable (i. e. , planned), such as primary's scheduled shutdown to perform routine maintenance or software upgrade. Traditionally, PBR employ LEA to recover from both unplanned and planned outages. In this paper, we propose a novel protocol, called Primary Shift Replication (PSR), to avoid election during planned outages. PSR shifts the primary role from the current primary to another scheduled node (without election) when a planned outage is about to occur. Number of messages and communication time required to shift the primary node to another node is much less than number of messages and time required to perform leader election; therefore, PSR improves system's availability. Moreover, PSR guarantees no transactions loss during the shift mode, hence, it preserves data consistency.
References
- N. Budhiraja, K. Marzullo, F. B. Schneider, and S. Toueg. 1993. The Primary-backup Approach. S. J. Mullender, editor, Distributed Systems, Addison-Wesley, (Chapter 8).
- Navin Budhiraja, Keith Marzullo. 1995. Tradeoffs in Implementing Primary-Backup Protocols. SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing.
- Greg N. Frederickson and Nancy A. Lynch. 1987. Electing a Leader in a Synchronous Ring. J. ACM, 34(1):98–115.
- H. Garcia-Molina. Elections in a Distributed Computing System. 1982. IEEE Trans. Computers, 31(1):48–59.
- Suresh Singh and James F. Kurose. 1994. Electing Good Leaders. Journal of Parallel and Distributed Computing, Volume 21, Issue 2, pages 184–201.
- Scott D. Stoller. 2000. Leader election in asynchronous distributed systems. IEEE Transactions on Computers, 49(3):283–284.
- AL-Metwally Mostafa, Ilies Alouini. Fault Tolerant Global Store Module. (2004). http://www. mozart-oz. org/mogul/doc/metwally/globalstore/
- Valentin Mesaros , Raphaël Collet , Kevin Glynn , Peter Van Roy. 2005. A Transactional System for Structured Overlay Networks. Research Report RR2005-01, Universit´e catholique de Louvain, D´epartement INGI.
- E. Cecchet, G. Candea, and A. Ailamaki. 2008. Middleware-based Database Replication: The Gaps Between Theory and Practice. ACM SIGMOD Conference, Vancouver, Canada.
- Rachid Guerraoui and Luís Rodrigues. 2006. Introduction to Reliable Distributed Programming. Springer-Verlag Berlin Heidelberg.
- Y. Saito and M. Shapiro. 2002. Replication: Optimistic Approaches. Technical Report, Microsoft Research Ltd.
- W. Lang, J. Patel, and J. Naughton. 2009. On Energy Management Load Balancing and Replication. SIGMOD Record, Vol. 38, No, 4, 2009
- M. EffatParvar, N. Yazdani, Mehdi. EffatParvar, A. Dadlani, and A. Khonsari. 2010. Improved Algorithm for Leadership Election in Distributed Systems. 2nd International Conference on Computer Engineering and Technology.
- D. P. Gawali. 2012. Leader Election Problem in Distributed Algorithm. International Journal of Computer Science and Technology.
- Mina Shirali, Abolfazl HaghighatToroghi, and Mehdi Vojdani. 2008. Leader Election Algorithms: History and Novel schemes. Third 2008 International Conference on Convergence and Hybrid Information Technology.
- Robbert van Renesse and Fred B. Schneider. 2004. Chain Replication for Supporting High Throughput and Availability. In OSDI'04: Proceedings of the 6th conference on Symposium on Operating Systems Design & Implementation, Berkeley, CA, USA.
- Heutelbeck, D. and Hemmje, M. 2006. Distributed Leader Election in P2P Systems for Dynamic Sets. MDM, Page(s): 29 – 29.
- Zargarnataj, M. 2007. New Election Algorithm Based on Assistant in Distributed Systems", AICCSA 07, Page(s):324 – 331.
- Summary of the Amazon EC2 and Amazon RDS Service Disruption in the US East Region. 2001. http://aws. amazon. com/message/65648/
Index Terms
Keywords