A Multi-Replica-Centered Commit Protocol for Distributed Real-Time and Embedded Applications

A Multi-Replica-Centered Commit Protocol for Distributed Real-Time and Embedded Applications

Anupama Arun, Sarvesh Pandey, Udai Shanker
Copyright: © 2021 |Pages: 19
DOI: 10.4018/IJSDA.20211001.oa18
Article PDF Download
Open access articles are freely available for download

Abstract

Modern multi-site database applications are not only time-driven but also require efficient quality of services with no single-node failure. It might be ideally achieved using database replication techniques. The transactions, being a basic component of these applications, are more likely to miss their deadlines because of requiring unpredictably long time to access remote data items. The temporal validity of data is another issue requiring attention to be paid. To address these problems, a Cluster-Replicas with Efficient Distributed Lazy Update (CRED) protocol is proposed in this paper. The CRED protocol increases the chance of timely execution of transactions and data freshness in an unpredictable workload environment by utilizing the lazy replica update strategy. It reduces the negative impact of the burst workload with a marginal overhead of ensuring timely-updated replicas. The simulation results confirm that the CRED outperforms the ORDER protocol by up to 4%.
Article Preview
Top

Introduction

In today’s digital era, there are countless real-world applications requiring access to the remotely distributed data present at multiple distant sites (Omamo, Rodrigues, & Muliaro, 2020) (M., K., & K., 2020). Telecommunication services and online trading systems are some of the easy-to-understand example applications (Mustafa, 2021) (Gupta & Shanker, 2020). Here, data is dispersed across geographically distant sites and a wide-area network is utilized to communicate among these sites (Pandey & Shanker, 2016) (Srivastava, Shankar, & Tiwari, A protocol for concurrency control in real-time replicated databases system, 2012). All such applications exhibit characteristics like a fast exchange rate with data access from anywhere at any time (Pierce, Shepherd, & Johnson, 2019) (Kizito & Semwanga, 2020). Besides, the location of a node/device can also be useful for some custom applications (Gupta & Shanker, 2021). With increased application complexity, the underlying data and transactions accessing that data both are associated with time constraints or deadlines. In simple words, one needs to take care of the fact that the data deadline is also honored in addition to the transaction deadline (Ulusoy, 1994) (Singh, Pandey, & Shanker, 2019). These applications require data that is constantly changing — weather data, stock prices, health indicators etc. So, data generated by such applications have some validity associated with it. This means that data can be used to take some action using transaction only before the expiry of its validity.

The above-discussed applications are studied under the umbrella of a research area named “Distributed Real-time Database Systems (DRTDBS)”. The DRTDBS is a finite set of geographically separated database sites connected through a network (Pandey & Shanker, 2020) (Shanker, Misra, & Sarje, 2006) (Pandey & Shanker, 2018). Each database site consists of one local database. Considering the whole set up as one logical unit, any such change in the state of data could be performed using real-time distributed transactions. A real-time distributed transaction is a real-time transaction that requires access to both local and remote data items. Going one level further down from a definition perspective, a real-time transaction is a transaction with associated time-constraint/deadline. The two key issues with DRTDBS based applications are deadline miss of transactions and expiry of data deadline. These issues mainly occur because of longer data access latency. A transaction processing framework mainly consists of the following components — priority assignment scheme (Pandey & Shanker, 2019), concurrency control (Pandey & Shanker, June 18-20, 2018) (Pandey & Shanker, 2017), and commit processing (Pandey & Shanker, 2018) (Pandey & Shanker, 2019). Replication of data requires adjustment in all the above 3 components.

Complete Article List

Search this Journal:
Reset
Volume 12: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 11: 5 Issues (2022)
Volume 10: 4 Issues (2021)
Volume 9: 4 Issues (2020)
Volume 8: 4 Issues (2019)
Volume 7: 4 Issues (2018)
Volume 6: 4 Issues (2017)
Volume 5: 4 Issues (2016)
Volume 4: 4 Issues (2015)
Volume 3: 4 Issues (2014)
Volume 2: 4 Issues (2013)
Volume 1: 4 Issues (2012)
View Complete Journal Contents Listing