Efficient cache availability management in Information-Centric Networks

Saha, Sumanta; Lukyanenko, Andrey; Ylä-Jääski, Antti

doi:10.1016/j.comnet.2015.04.005

Cited by 17 publications

(5 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Zhan and Wen 30 have considered small cell base stations (SBS) with limited caching ability to reduce the load at small cell base stations. 31 have used the cache retention ratio with variable data population for the efficient cache availability management in information-centric networks.…”

Section: Resultsmentioning

confidence: 99%

Traffic Analysis for Storage Finding in Video on Demand System

Kanrar¹

2017

Research J. of Information Technology

View full text Add to dashboard Cite

Background and Objective: The literature survey typically predicated sharp growth for IP-based video traffic i.e., 30% or more annually.For the Internet TV in mobile networks, video traffic growth rate is expected to rise 80% or more. These high growth rates of video traffic will account for a large portion of the bandwidth. The performance of video-on-demand system during real-time data streaming greatly depends on the session oriented data-storage finding in the mass scale distributed storage architecture. At the storage end, data is broken up into manageable chunks of data packets, which could be smoothly, deliver over the Internet. The objective of this study was to present the necessity of traffic control and traffic analysis methodology in the video on demand system to minimize the hop count for finding exact media storage to retrieve video chunk data. Methodology: Multiple inbound and outbound connections virtually appear a single connection to the user. The session based storage finding mechanism emphasis inbounds paths from distributed storage. The minimum hop counts for storage finding effectively reduce the search cost in video on demand system. For the enhancement of overall system performance, Zipf approximation was used particularly for the outbound traffic requests from the user end. The LRFU (least recently frequently used) mechanism was implemented on the 'web cache' at storage node with a considerable cache hit ratio. The inbound traffic flows for BGP using the AS̲PATH metric to avoid loops. If the route paths are not locally organized, then the route path uses the AS̲PATH attribute to ties between the weight and local preference attributes. The attributes are used to select a particular path that controls inbound traffic. Results: This study presents novel solutions regarding the existing issues on the video traffic flow. Three stages of simulation have been observed according to the aforesaid methodology. In the first stage of simulation, traffic analysis determined the VOD system. In the second stage of simulation, it has been considered distributed database storages. In third stage number of phases considered to make complete simulations. Conclusion: Traffic control and traffic analysis methodology for video on demand system minimizes the hop count during exact storage search.

show abstract

Section: Resultsmentioning

confidence: 99%

Traffic Analysis for Storage Finding in Video on Demand System

Kanrar¹

2017

Research J. of Information Technology

View full text Add to dashboard Cite

show abstract

“…It supports multiple platforms and the reference sequence for each node is constant with the packet. However, the disadvantage of this approach is that it may require additional space to store the sequence of elements at different points in the cache [24].…”

Section: Fig 5 Lce Lcd and Prob Algorithm Implementation Processmentioning

confidence: 99%

A survey of cache placement algorithms in content delivery networks

Makhkamov,

Khasanov

2023

E3S Web of Conf.

View full text Add to dashboard Cite

This paper analyzes cache deployment algorithms in content delivery networks (CDN), which are important for increasing content delivery speed, reducing network traffic, and ensuring scalability. A CDN is a geographically distributed network infrastructure, which is placed on the Internet and is aimed at reliably delivering content to users, as well as reducing traffic on the networks of communication operators. A content delivery network serves as an important element in today’s internet infrastructure to ensure fast and secure delivery of content around the world. When using a content delivery network, it uses local cache servers to keep copies of content on a central resource server closer to end users. This reduces latency and increases content delivery speed. Cache placement algorithms determine which cache server to store content and where to place it. As the demand for high-quality content continues to grow, caching algorithms play an increasingly important role in efficiently delivering content to users around the world. This article analyzes caching algorithms in CDNs, including their advantages, disadvantages, and application areas.

show abstract

“…For instance, [26] proposed an online distributed cache management solution for informationcentric networks in which cache "managers" periodically exchange messages to identify changes needed in their cache store to improve caching gain. Citing prohibitive signaling overhead in cooperative caching, [27] attempted to strike a balance between performance and scalability via a lightweight local cooperation caching design. In [28], an agent reinforcement learning-based cooperative content caching policy is proposed for the mobile edge networks (MENs) when the users' preference is unknown.…”

Section: A Online Reactionary Approachmentioning

confidence: 99%

Information Resilience in a Network of Caches With Perturbations

Wu¹,

Chai

2021

IEEE Access

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

Efficient cache availability management in Information-Centric Networks

Cited by 17 publications

References 33 publications

Traffic Analysis for Storage Finding in Video on Demand System

Traffic Analysis for Storage Finding in Video on Demand System

A survey of cache placement algorithms in content delivery networks

Information Resilience in a Network of Caches With Perturbations

Contact Info

Product

Resources

About