scholarly journals NCDN: A Node-Failure Resilient CDN Solution with Reinforcement Learning Optimization

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhihao Wang ◽  
Shengyong Du ◽  
Min Ren

Content Delivery Networks (CDNs) have enabled large-scale, reliable, and efficient content distribution over the Internet. Although CDNs have been very successful in serving a large portion of Internet traffic, they have several drawbacks. Despite their distributed nature, they rely on largely centralized management and replication. This can affect availability in case of node failure. Further, CDNs are complex infrastructures that span multiple layers of the networking stack. To address these issues, in this paper, we introduce NCDN, a novel highly distributed system for large-scale delivery of content and services. NCDN is designed to provide resilience against node failure through location-independent storage and replication of content. This is achieved through a two-layer architecture: the first layer (exposure layer) exposes services implemented by NCDN (e.g., Web, SFTP) to clients; the second layer (hidden layer) provides reliable distributed storage of content and application state. Content in NCDN’s hidden layer is stored and exchanged as Named Data Network (NDN) content packets. We employ the reinforcement learning (RL) to dynamically learn the optimal numbers of duplicates for different type of contents, because the RL agent has the advantage of not requiring expert labels or knowledge and instead the ability to learn directly from its own interaction with the world. The combination of NDN and RL brings NCDN fine-grained, fully decentralized content replication mechanisms. We compare the performance and resilience of NCDN to those of an idealized CDN via extensive simulations. Our results show that NCDN is able to provide higher availability than CDNs (between 8% and 100% higher under the same conditions), without substantially increasing content retrieval delay.

2021 ◽  
Vol 13 (11) ◽  
pp. 278
Author(s):  
Jesús Fernando Cevallos Moreno ◽  
Rebecca Sattler ◽  
Raúl P. Caulier Cisterna ◽  
Lorenzo Ricciardi Celsi ◽  
Aminael Sánchez Rodríguez ◽  
...  

Video delivery is exploiting 5G networks to enable higher server consolidation and deployment flexibility. Performance optimization is also a key target in such network systems. We present a multi-objective optimization framework for service function chain deployment in the particular context of Live-Streaming in virtualized content delivery networks using deep reinforcement learning. We use an Enhanced Exploration, Dense-reward mechanism over a Dueling Double Deep Q Network (E2-D4QN). Our model assumes to use network function virtualization at the container level. We carefully model processing times as a function of current resource utilization in data ingestion and streaming processes. We assess the performance of our algorithm under bounded network resource conditions to build a safe exploration strategy that enables the market entry of new bounded-budget vCDN players. Trace-driven simulations with real-world data reveal that our approach is the only one to adapt to the complexity of the particular context of Live-Video delivery concerning the state-of-art algorithms designed for general-case service function chain deployment. In particular, our simulation test revealed a substantial QoS/QoE performance improvement in terms of session acceptance ratio against the compared algorithms while keeping operational costs within proper bounds.


Author(s):  
Prabir Bhattacharya ◽  
Minzhe Guo

Content delivery is a key technology on the Internet to achieve large scale, low-latency, reliable, and intelligent data delivery. Replica placement (RP) is a key machinery in content delivery systems to achieve efficient and effective content delivery. This work proposes a novel decentralized algorithm for the replica placement in peer-assisted content delivery networks with simultaneous considerations for peer incentives. By applying techniques from the algorithmic mechanism design theory, the authors show the incentive compatibility of the proposed algorithm. Experiments were conducted to validate the properties of the proposed method and comparisons were made with the state-of-the-art RP algorithms.


2018 ◽  
Vol 27 (12) ◽  
pp. 1850189 ◽  
Author(s):  
Hadi Zare Fatin ◽  
Shahram Jamali ◽  
Gholamreza Zare Fatin

Content delivery networks (CDN) bring the content close to the users employing the replicated servers. In this context, main issue is allocation of the content replicas to these geographically distributed replica servers. The allocation goal is to minimize the storage and the delivery costs and at the same time to satisfy service-level agreements. In this paper, a mixed integer programming (MIP) formulation for the problem of the allocation has been proposed and then by utilization of the genetic algorithm (GA) its optimum solutions were extracted. Numerical evaluation results show that the proposed algorithm outperforms others in terms of the storage cost, delivery cost and computation complexity.


Sign in / Sign up

Export Citation Format

Share Document