Network Coding-based Data Storage and Retrieval for Kademlia

TY - GEN

T1 - Network Coding-based Data Storage and Retrieval for Kademlia

AU - Marandi, Sayed Ali

AU - Sehat, Hadi

AU - Lucani Rötter, Daniel Enrique

AU - Mousavifar, Saeid

AU - Jacobsen, Rune Hylsberg

PY - 2021/4

Y1 - 2021/4

N2 - Peer-to-peer distributed storage systems can be instrumental to develop solutions able to store the massive amounts of data generated by the Internet of Things (IoT) users. Given the higher probability of node failures, losses in the communication channels, and limited resources of devices compared to centralized storage solutions, it is key to minimize data retrieval time, while also maintaining high resiliency in the system. We propose a method based on random linear network coding (RLNC) for data storage and retrieval and the use of Kademlia for our peer-to-peer design to address these challenges. We analyze the performance of the proposed RLNC-based method theoretically as well as the traditional Kademlia in terms of data retrieval time and resiliency to node failures and channel losses. We use PeerSim to simulate the proposed method. Our theoretical analysis and simulation results show that the proposed RLNC-based method significantly outperforms traditional Kademlia for our core performance metrics. These gains in resiliency and data retrieval time are achieved while also reducing the data storage time for a wide region of operation. Our simulations show that only if the redundancy of the RLNC-based scheme is significantly increased (> 100 % redundant RLNC packets), then a small degradation (< 10 %) in data storage time occurs.

AB - Peer-to-peer distributed storage systems can be instrumental to develop solutions able to store the massive amounts of data generated by the Internet of Things (IoT) users. Given the higher probability of node failures, losses in the communication channels, and limited resources of devices compared to centralized storage solutions, it is key to minimize data retrieval time, while also maintaining high resiliency in the system. We propose a method based on random linear network coding (RLNC) for data storage and retrieval and the use of Kademlia for our peer-to-peer design to address these challenges. We analyze the performance of the proposed RLNC-based method theoretically as well as the traditional Kademlia in terms of data retrieval time and resiliency to node failures and channel losses. We use PeerSim to simulate the proposed method. Our theoretical analysis and simulation results show that the proposed RLNC-based method significantly outperforms traditional Kademlia for our core performance metrics. These gains in resiliency and data retrieval time are achieved while also reducing the data storage time for a wide region of operation. Our simulations show that only if the redundancy of the RLNC-based scheme is significantly increased (> 100 % redundant RLNC packets), then a small degradation (< 10 %) in data storage time occurs.

UR - http://www.scopus.com/inward/record.url?scp=85112417542&partnerID=8YFLogxK

U2 - 10.1109/VTC2021-Spring51267.2021.9448845

DO - 10.1109/VTC2021-Spring51267.2021.9448845

M3 - Article in proceedings

T3 - I E E E V T S Vehicular Technology Conference. Proceedings

BT - 2021 IEEE 93rd Vehicular Technology Conference, VTC 2021-Spring - Proceedings

PB - IEEE

T2 - IEEE VTC2021-Spring Helsinki

Y2 - 25 April 2021 through 28 April 2021

ER -