Wu, D. and Chai, W. K., 2021. Information Resilience in a Network of Caches with Perturbations. IEEE Access, 9 (36135 - 136150), 136135-136150.
Full text available as:
|
PDF (OPEN ACCESS ARTICLE)
Information_Resilience_in_a_Network_of_Caches_With_Perturbations.pdf - Published Version Available under License Creative Commons Attribution. 1MB | |
Copyright to original material in this document is with the original owner(s). Access to this content through BURO is granted on condition that you use it only for research, scholarly or other non-commercial purposes. If you wish to use it for any other purposes, you must contact BU via BURO@bournemouth.ac.uk. Any third party copyright material in this document remains the property of its respective owner(s). BU grants no licence for further use of that third party material. |
DOI: 10.1109/ACCESS.2021.3111699
Abstract
Caching in a network of caches has been widely investigated for improving information/content delivery efficiency (e.g., for reducing content delivery latency, server load and bandwidth utilization). In this work, we look into another dimension of network of caches – enhancing resilience in information dissemination rather than improving delivery efficiency. The underlying premise is that when information is cached at more locations, its availability is increased and thus, in turn, improve information delivery resiliency. This is especially important for networks with perturbations (e.g., node failures). Considering a general network of caches, we present a collaborative caching framework for maximizing the availability of the information. Specifically, we formulate an optimization problem for maximizing the joint utility of caching nodes in serving content requests in perturbed networks. We first solve the centralized version of the problem and then propose a distributed caching algorithm that approximates the centralized solution. We compare our proposal against different caching schemes under a range of parameters, using both real-world and synthetic network topologies. The results show that our algorithm can significantly improve the joint utility of caching nodes. With our distributed caching algorithm, the achieved caching utility is up to five times higher than greedy caching scheme. Furthermore, our scheme is found to be robust against increasing node failure rate, even for networks with a high number of vulnerable nodes.
Item Type: | Article |
---|---|
ISSN: | 2169-3536 |
Uncontrolled Keywords: | Information resilience, caching, network of caches, network with perturbations; |
Group: | Faculty of Science & Technology |
ID Code: | 35993 |
Deposited By: | Symplectic RT2 |
Deposited On: | 14 Sep 2021 10:38 |
Last Modified: | 14 Mar 2022 14:29 |
Downloads
Downloads per month over past year
Repository Staff Only - |