The Content Placement Problem in D2D Networks Under Coupling Distributed Caching and Distributed Storage

2018 ◽  
pp. 217-228 ◽  
Author(s):  
Basma Nissar ◽  
Ahmed El Ouadrhiri ◽  
Mohamed El Kamili
Keyword(s):  
Distributed Storage ◽  
Placement Problem ◽  
Distributed Caching ◽  
Content Placement

scholarly journals An On-Path Caching Scheme Based on the Expected Number of Copies in Information-Centric Networks

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1705
Author(s):  
Yuanhang Li ◽  
Jinlin Wang ◽  
Rui Han
Keyword(s):  
Network Architectures ◽  
Expected Number ◽  
Placement Problem ◽  
Mobility Support ◽  
Allocation Method ◽  
Caching Scheme ◽  
Content Popularity ◽  
Content Placement ◽  
The Given ◽  
Cache Allocation

The Information-Centric Network (ICN) is one of the most influential future network architectures and in-network caching in ICN brings some helpful features, such as low latency and mobility support. How to allocate cache capacity and place content properly will greatly influence the performance of ICN. This paper focuses on the cache allocation problem and content placement problem under the given cache space budget. Firstly, a lightweight allocation method utilizing information of both topology and content popularity is proposed, to allocate cache space and get the expected number of copies of popular content. The expected number of copies represents the number of content copies placed in the topology. Then, an on-path caching scheme based on the expected number of copies is proposed to handle the content placement problem. In the cache allocation scenario, the lightweight allocation method performs better than other baseline methods. In the content placement scenario, Leave Copy Down (LCD) based on the expected number of copies performs the second-best and is very close to Optimal Content Placement (OCP).

scholarly journals Multi-Location-Aware Joint Optimization of Content Caching and Delivery for Backhaul-Constrained UDN

Sensors ◽  
2019 ◽  
Vol 19 (11) ◽  
pp. 2449 ◽  
Author(s):  
Wenpeng Jing ◽  
Xiangming Wen ◽  
Zhaoming Lu ◽  
Haijun Zhang
Keyword(s):  
Content Delivery ◽  
Decision Time ◽  
Base Stations ◽  
Joint Optimization ◽  
Resources Allocation ◽  
User Association ◽  
Placement Problem ◽  
Content Caching ◽  
Backhaul Link ◽  
Content Placement

Mobile edge caching is regarded as a promising way to reduce the backhaul load of the base stations (BSs). However, the capacity of BSs’ cache tends to be small, while mobile users’ content preferences are diverse. Furthermore, both the locations of users and user-BS association are uncertain in wireless networks. All of these pose great challenges on the content caching and content delivery. This paper studies the joint optimization of the content placement and content delivery schemes in the cache-enabled ultra-dense small-cell network (UDN) with constrained-backhaul link. Considering the differences in decision time-scales, the content placement and content delivery are investigated separately, but their interplay is taken into consideration. Firstly, a content placement problem is formulated, where the uncertainty of user-BS association is considered. Specifically, different from the existing works, the specific multi-location request pattern is considered that users tend to send content requests from more than one but limited locations during one day. Secondly, a user-BS association and wireless resources allocation problem is formulated, with the objective of maximizing users’ data rates under the backhaul bandwidth constraint. Due to the non-convex nature of these two problems, the problem transformation and variables relaxation are adopted, which convert the original problems into more tractable forms. Then, based on the convex optimization methods, a content placement algorithm, and a cache-aware user association and resources allocation algorithm are proposed, respectively. Finally, simulation results are given, which validate that the proposed algorithms have obvious performance advantages in terms of the network utility, the hit ratio of the cache, and the quality of service guarantee, and are suitable for the cache-enabled UDN with constrained-backhaul link.

Performance Analysis of a Global Filesystem on Distributed Storage Pools

2016 ◽  
Author(s):  
Joon Woo ◽  
◽  
Ji-Hoon Jang ◽  
Hyong-Shik Kim ◽  
◽  
...  
Keyword(s):  
Performance Analysis ◽  
Distributed Storage ◽  
Storage Pools

Distributed storage evaluation on a three-wide inter-data center deployment

2013 ◽  
Author(s):  
Yih-Farn Chen ◽  
Scott Daniels ◽  
Marios Hadjieleftheriou ◽  
Pingkai Liu ◽  
Chao Tian ◽  
...  
Keyword(s):  
Data Center ◽  
Distributed Storage
Sign in / Sign up

Export Citation Format

Share Document