DSPE: Profit Maximization in Edge-Cloud Storage System using Dynamic Space Partitioning with Erasure Code
Shubhradeep Roy, Suvarthi Sarkar, Vivek Verma, Aryabartta Sahu

TL;DR
This paper introduces DSPE, a profit-driven framework for edge-cloud storage that combines collaborative caching, erasure coding, and dynamic space partitioning to enhance data access efficiency and system profitability.
Contribution
The paper proposes a novel dynamic space partitioning approach integrated with erasure coding and elastic caching for profit maximization in edge storage systems.
Findings
Improves system profitability by 5-8% over existing methods.
Effectively handles dynamic workloads with synthetic and real-world data.
Enhances data access latency and storage efficiency.
Abstract
Edge Storage Systems have emerged as a critical enabler of low latency data access in modern cloud networks by bringing storage and computation closer to end users. However, the limited storage capacity of edge servers poses significant challenges in handling high volume and latency sensitive data access requests, particularly under dynamic workloads. In this work, we propose a profit driven framework that integrates three key mechanisms which are collaborative caching, erasure coding, and elastic storage partitioning. Unlike traditional replication, erasure coding enables space efficient redundancy, allowing data to be reconstructed from any subset of K out of K plus M coded blocks. We dynamically partition each edge server s storage into private and public regions. The private region is further subdivided among access points based on their incoming request rates, enabling adaptive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
