Providing Information Resilience Through Modularity-Based Caching in Perturbed Information-Centric Networks

Chai, Wei Koong; Sourlas, Vasilis; Pavlou, George

doi:10.23919/itc.2017.8064358

Cited by 4 publications

(6 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, it only considers single-hop routing in its distributed caching system, and thus cannot be directly applied into the path routing with multi-hops. [43] employs a modularity-based information caching approach by leveraging information reachability to achieve reliable communication of information under adverse network conditions. [44] maximizes the expected caching gain through a distributed resilient caching algorithm (DR-Cache) considering network failures.…”

Section: Related Workmentioning

confidence: 99%

Joint optimization of cache placement and request routing in unreliable networks

Song

Yang

et al. 2021

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Joint optimization of cache placement and request routing in unreliable networks

Song

Yang

et al. 2021

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…For information resilience, [10] considered implicit cooperation amongst caching nodes by exploiting features of network topology and proposed a modularity-based caching scheme that allows nodes within a community structure to cache content with origins outside of that community. This solution does not require explicit communication between caching nodes but nonetheless, still increases the diversity of content cached within the community.…”

Section: A Online Reactionary Approachmentioning

confidence: 99%

Information Resilience in a Network of Caches With Perturbations

Wu¹,

Chai

2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…In fact, it is reported that IT downtime due to equipment failures costs enterprises billions of dollars a year [1]. In the area of information-centric networking (ICN), the authors in [6] investigated the provision of information resilience through a caching approach based on the concept of modularity.…”

Section: Introductionmentioning

confidence: 99%

DR-Cache: Distributed Resilient Caching with Latency Guarantees

Phan

Chai

et al. 2018

IEEE INFOCOM 2018 - IEEE Conference on Computer Communications

Self Cite

View full text Add to dashboard Cite

The dominant application in today's Internet is content streaming, which is increasingly relying on caches to meet the stringent conditions on the latency between content servers and end-users. These systems routinely face the challenges of limited bandwidth capacities and network server failures, which degrade caching performance. In this paper, we study the problem of optimally allocating content over a resilient caching network, in which each cache may fail under some situations. Given content request rates and multiple routing paths, we formulate an optimization problem to maximize the expected caching gain, i.e., the reduction of latency due to intermediate caching. The offline version of this problem is NP-hard. We first propose a centralized, offline algorithm and show that a solution with (1-1/e) approximation ratio to the optimal can be constructed. We then propose a distributed ascent algorithm based on the concave relaxation of the expected gain. Informed by the results of our analysis, we finally propose a distributed resilient caching algorithm (DR-Cache) that is simple and adaptive to network failures. We show numerically that DR-Cache significantly outperforms other candidate algorithms under synthetic requests, as well as real world traces over a class of network topologies.

show abstract

Providing Information Resilience Through Modularity-Based Caching in Perturbed Information-Centric Networks

Cited by 4 publications

References 31 publications

Joint optimization of cache placement and request routing in unreliable networks

Joint optimization of cache placement and request routing in unreliable networks

Information Resilience in a Network of Caches With Perturbations

DR-Cache: Distributed Resilient Caching with Latency Guarantees

Contact Info

Product

Resources

About