We focus on a mobile caching system using erasure codes to cache content in mobile devices, which enter and depart a fixed area according to Poisson process. Due to the high mobility of devices, cached content is lost and to be repaired by device-to-device (D2D) communication. We consider the limited communication range and repair process with multiple contacts among mobile devices. We adopt a coded repair scheme which the repair process runs periodically, and derive analytical expressions of the average repair delay. The derived expressions are then used to evaluate repair delay using different erasure codes and file size. The results show that maximum distance separable codes can yield lower average repair delay compared to regenerating codes for small size of file. We further find that increasing the speed of mobile devices can reduce the average repair delay.
Repair Delay Performance Analysis of Mobile Caching Systems Using Erasure Codes
01.05.2020
255361 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Erasure Decoding for Gabidulin Codes
British Library Online Contents | 2011
|Delay-Minimized Mobile Edge Caching in the Terrestrial HetVNet
Springer Verlag | 2021
|Caching at the Edge with LT codes
Deutsches Zentrum für Luft- und Raumfahrt (DLR) | 2018
|Caching at the edge with Fountain Codes
Deutsches Zentrum für Luft- und Raumfahrt (DLR) | 2018
|