Pith. sign in

REVIEW

Locality, Latency and Spatial-Aware Data Placement Strategies at the Edge

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2212.01984 v2 pith:H6TX6KSP submitted 2022-12-05 cs.DC

classification cs.DC
keywords edgedataplacementlatencyconstraintsdistance-basedlatency-basedlocality
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The vast data deluge at the network's edge is raising multiple challenges for the edge computing community. One of them is identifying edge storage servers where data from edge devices/sensors have to be stored to ensure low latency access services to emerging edge applications. Existing data placement algorithms mainly focus on locality, latency, and zoning to select edge storage servers under multiple environmental constraints. This paper uses a data placement framework to compare distance-based, latency-based, and spatial-awareness-based data placement strategies, which all share a decision-making system with similar constraints. Based on simulation experiments, we observed that the spatial-awareness-based strategy could provide a quality of service on par with the latency-based and better than the distance-based strategy.

Discussion (0). Continue with ORCID to comment.

Pith tools