pith. sign in

arxiv: 1901.11102 · v1 · pith:3I2GNB7Znew · submitted 2019-01-30 · 💻 cs.IT · cs.NI· math.IT

Spatial Soft-Core Caching

classification 💻 cs.IT cs.NImath.IT
keywords cachessccplacementhard-coreindependentpoliciesprobabilityrequired
0
0 comments X
read the original abstract

We propose a decentralized spatial soft-core cache placement (SSCC) policy for wireless networks. SSCC yields a spatially balanced sampling via negative dependence across caches, and can be tuned to satisfy cache size constraints with high probability. Given a desired cache hit probability, we compare the 95% confidence intervals of the required cache sizes for independent placement, hard-core placement and SSCC policies. We demonstrate that in terms of the required cache storage size, SSCC can provide up to more than 180% and 100% gains with respect to the independent and hard-core placement policies, respectively. SSCC can be used to enable proximity-based applications such as device-to-device communications and peer-to-peer networking as it promotes the item diversity and reciprocation among the nodes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.