TY - GEN
T1 - Information Flow Graph for Distributed Caching without Newcomers over a Broadcast Medium
AU - Zimmermann, Sandra
AU - Schwenteck, Paul
AU - Meißner, Willi
AU - Vielhaus, Christian
AU - Cabrera, Juan A.
AU - Fitzek, Frank H.P.
AU - Reisslein, Martin
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - The trade-offs between storage and repair traffic for replacing failed storage nodes with new nodes (newcomers) in data centers with an omniscient controller are well understood. However, in edge storage settings, newcomers are not readily available, necessitating resilient data storage (caching) without newcomers. Edge storage nodes can often communicate via a broadcast wireless medium, which can be exploited to reduce the transmitted repair traffic via network coding. Repairs for resilient distributed caching without newcomers over a broadcast medium with Random Linear Network Coding (RLNC), which does not require an omniscient controller, have not been previously studied. We develop an information-theoretic model to characterize the theoretically achievable trade-offs between stored data and transmitted repair data in the RLNC broadcast setting without newcomers. Specifically, we formulate an Information Flow Graph (FG) model and identify all cuts in the resulting FG. We validate the theoretical FG model with simulations that demonstrate that the practically achievable trade-offs are close to the theoretical trade-offs.
AB - The trade-offs between storage and repair traffic for replacing failed storage nodes with new nodes (newcomers) in data centers with an omniscient controller are well understood. However, in edge storage settings, newcomers are not readily available, necessitating resilient data storage (caching) without newcomers. Edge storage nodes can often communicate via a broadcast wireless medium, which can be exploited to reduce the transmitted repair traffic via network coding. Repairs for resilient distributed caching without newcomers over a broadcast medium with Random Linear Network Coding (RLNC), which does not require an omniscient controller, have not been previously studied. We develop an information-theoretic model to characterize the theoretically achievable trade-offs between stored data and transmitted repair data in the RLNC broadcast setting without newcomers. Specifically, we formulate an Information Flow Graph (FG) model and identify all cuts in the resulting FG. We validate the theoretical FG model with simulations that demonstrate that the practically achievable trade-offs are close to the theoretical trade-offs.
KW - Broadcast
KW - Distributed caching
KW - Random Linear Network Coding (RLNC)
KW - Resilience
UR - http://www.scopus.com/inward/record.url?scp=85168707536&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85168707536&partnerID=8YFLogxK
U2 - 10.1109/WoWMoM57956.2023.00017
DO - 10.1109/WoWMoM57956.2023.00017
M3 - Conference contribution
AN - SCOPUS:85168707536
T3 - Proceedings - 2023 IEEE 24th International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2023
SP - 30
EP - 35
BT - Proceedings - 2023 IEEE 24th International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 24th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2023
Y2 - 12 June 2023 through 15 June 2023
ER -