"Reduction of Monetary Cost in Cloud Storage System by Using Extended Strict Timed Causal Consistency"

Cloud storage systems have been introduced to provide a scalable, secure, reliable, and highly available data storage environment for the organizations and end-users. Therefore, the service provider should grow in a geographical extent. Consequently, extensive storage service provision requires a replication mechanism. Replication imposes many costs on the cloud storage, including the synchronization, communications, storage, etc., costs among the replicas. Moreover, the synchronization process among replicas is a major challenge in cloud storage. Therefore, consistency can be defined as the coordination among the replicas. In this paper, we propose an extension to the strict timed causal consistency by adding the considerations for the monetary costs and the number of violations in the cloud storage systems and call it the extended strict timed causal consistency. Our proposed supports monotonic read, read your write, monotonic write, and write follow read, models by taking into account the causal relations between users' operations, at the client-side. Besides, it supports timed causal at the server-side. We employed the Cassandra cloud database that supports various consistencies such as all, one, quorum, etc. Our method performs better in reducing staleness rate, the severity of violations, and monetary cost in comparison with all, one, quorum, and causal.

READ FULL TEXT
research
02/25/2019

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication

Geo-replicated data platforms are at the backbone of several large-scale...
research
08/27/2020

A Brief Survey on Replica Consistency in Cloud Environments

Cloud computing is a general term that involves delivering hosted servic...
research
01/08/2019

Inversion-based Measurement of Data Consistency for Read/Write Registers

Both provides and consumers of distributed storage services can benefit ...
research
03/21/2019

Distributed Transactional Systems Cannot Be Fast

We prove that no fully transactional system can provide fast read transa...
research
04/18/2019

Harmonia: Near-Linear Scalability for Replicated Storage with In-Network Conflict Detection

Distributed storage employs replication to mask failures and improve ava...
research
03/15/2022

Cost-effective BlackWater Raft on Highly Unreliable Nodes at Scale Out

The Raft algorithm maintains strong consistency across data replicas in ...
research
05/15/2020

Data Freshness in Leader-Based Replicated Storage

Leader-based data replication improves consistency in highly available d...

Please sign up or login with your details

Forgot password? Click here to reset