Pushing the Limits of In-Network Caching for Key-Value Stores

July 31, 2024 ยท Declared Dead ยท ๐Ÿ› Symposium on Networked Systems Design and Implementation

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Gyuyeong Kim arXiv ID 2407.21324 Category cs.NI: Networking & Internet Citations 6 Venue Symposium on Networked Systems Design and Implementation Last Checked 3 months ago
Abstract
We present OrbitCache, a new in-network caching architecture that can cache variable-length items to balance a wide range of key-value workloads. Unlike existing works, OrbitCache does not cache hot items in the switch memory. Instead, we make hot items revisit the switch data plane continuously by exploiting packet recirculation. Our approach keeps cached key-value pairs in the switch data plane while freeing them from item size limitations caused by hardware constraints. We implement an OrbitCache prototype on an Intel Tofino switch. Our experimental results show that OrbitCache can balance highly skewed workloads and is robust to various system conditions.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Networking & Internet

Died the same way โ€” ๐Ÿ‘ป Ghosted