Load Balancing Performance in Distributed Storage with Regular Balanced Redundancy

10/13/2019
by   Mehmet Fatih Aktas, et al.
0

Contention at the storage nodes is the main cause of long and variable data access times in distributed storage systems. Offered load on the system must be balanced across the storage nodes in order to minimize contention, and load balance in the system should be robust against the skews and fluctuations in content popularities. Data objects are replicated across multiple nodes in practice to allow for load balancing. However redundancy increases the storage requirement and should be used efficiently. We evaluate load balancing performance of natural storage schemes in which each data object is stored at d different nodes and each node stores the same number of objects. We find that load balance in a system of n nodes improves multiplicatively with d as long as d = o(log(n)), and improves exponentially as soon as d = Θ(log(n)). We show that the load balance in the system improves the same way with d when the service choices are created with XOR's of r objects rather than object replicas, which also reduces the storage overhead multiplicatively by r. However, unlike accessing an object replica, access through a recovery set composed by an XOR'ed object copy requires downloading content from r nodes, which increases the load imbalance in the system additively by r.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2022

Coded Data Rebalancing for Distributed Data Storage Systems with Cyclic Storage

We consider replication-based distributed storage systems in which each ...
research
01/24/2019

DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching

Load balancing is critical for distributed storage to meet strict servic...
research
10/06/2020

Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs

In computer networks, participants may cooperate in processing tasks, so...
research
03/15/2021

PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy

Data redundancy provides resilience in large-scale storage clusters, but...
research
01/15/2020

Secrecy and Accessibility in Distributed Storage

A distributed storage system (DSS) needs to be efficiently accessible an...
research
01/23/2022

Balanced and Swap-Robust Trades for Dynamical Distributed Storage

Trades, introduced by Hedayat, are two sets of blocks of elements which ...
research
11/01/2022

Benchmarking Hashing Algorithms for Load Balancing in a Distributed Database Environment

Modern high load applications store data using multiple database instanc...

Please sign up or login with your details

Forgot password? Click here to reset