On Existence of Latency Optimal Uncoded Storage Schemes in Geo-Distributed Data Storage Systems

TL;DR

This paper investigates the conditions under which uncoded data storage schemes in geo-distributed systems are latency optimal, and proposes coding solutions when such schemes do not exist, improving data retrieval efficiency.

Contribution

It establishes necessary and sufficient conditions for the existence of latency optimal uncoded storage schemes and introduces efficient coding methods for cases lacking such schemes.

Findings

Characterizes when latency optimal uncoded schemes exist.

Provides conditions linking data placement to latency performance.

Proposes binary coding schemes for non-existent optimal uncoded schemes.

Abstract

We consider the problem of geographically distributed data storage in a network of servers (or nodes) where the nodes are connected to each other via communication links having certain round-trip times (RTTs). Each node serves a specific set of clients, where a client can request for any of the files available in the distributed system. The parent node provides the requested file if available locally; else it contacts other nodes that have the data needed to retrieve the requested file. This inter-node communication incurs a delay resulting in a certain latency in servicing the data request. The worst-case latency incurred at a servicing node and the system average latency are important performance metrics of a storage system, which depend not only on inter-node RTTs, but also on how the data is stored across the nodes. Data files could be placed in the nodes as they are, i.e., in uncoded fashion, or can be coded and placed. This paper provides the necessary and sufficient conditions for the existence of uncoded storage schemes that are optimal in terms of both per-node worst-case latency and system average latency. In addition, the paper provides efficient binary storage codes for a specific case where optimal uncoded schemes do not exist.