Cooperative Caching Strategy Based on Two-Layer Caching Model for Remote Sensing Satellite Networks

In Information Centric Networking(ICN)where content is the object of exchange,in-network caching is a unique functional feature with the ability to handle data storage and distribution in remote sensing satellite networks.Setting up cache space at any node enables users to access data nearby,thus relieving the processing pressure on the servers.However,the existing caching strategies still suffer from the lack of global planning of cache contents and low utilization of cache resources due to the lack of fine-grained division of cache contents.To address the issues mentioned,a cooperative caching strategy(CSTL)for remote sensing satellite networks based on a two-layer caching model is proposed.The two-layer caching model is constructed by setting up separate cache spaces in the satellite network and the ground station.Probabilistic caching of popular contents in the region at the ground station to reduce the access delay of users.A content classification method based on hierarchical division is proposed in the satellite network,and differential probabilistic caching is employed for different levels of content.The cached content is also dynamically adjusted by analyzing the subsequent changes in the popularity of the cached content.In the two-layer caching model,ground stations and satellite networks collaboratively cache to achieve global planning of cache contents,rationalize the utilization of cache resources,and reduce the propagation delay of remote sensing data.Simulation results show that the CSTL strategy not only has a high cache hit ratio compared with other caching strategies but also effectively reduces user request delay and server load,which satisfies the timeliness requirement of remote sensing data transmission.

ECC:Edge Collaborative Caching Strategy for Differentiated Services Load-Balancing

Due to the explosion of network data traffic and IoT devices,edge servers are overloaded and slow to respond to the massive volume of online requests.A large number of studies have shown that edge caching can solve this problem effectively.This paper proposes a distributed edge collaborative caching mechanism for Internet online request services scenario.It solves the problem of large average access delay caused by unbalanced load of edge servers,meets users’differentiated service demands and improves user experience.In particular,the edge cache node selection algorithm is optimized,and a novel edge cache replacement strategy considering the differentiated user requests is proposed.This mechanism can shorten the response time to a large number of user requests.Experimental results show that,compared with the current advanced online edge caching algorithm,the proposed edge collaborative caching strategy in this paper can reduce the average response delay by 9%.It also increases the user utility by 4.5 times in differentiated service scenarios,and significantly reduces the time complexity of the edge caching algorithm.

A Caching Strategy for Streaming Media

It is expected that by 2003 continuous media will account for more than 50% of the data available on origin servers, this will provoke a significant change in Internet workload. Due to the high bandwidth requirements and the long-lived nature of digital video, streaming server loads and network bandwidths are proven to be major limiting factors. Aiming at the characteristics of broadband network in residential areas, this paper proposes a popularity-based server-proxy caching strategy for streaming media. According to a streaming media popularity on streaming server and proxy, this strategy caches the content of the streaming media partially or completely. The paper also proposes two formulas that calculate the popularity coefficient of a streaming media on server and proxy, and caching replacement policy. As expected, this strategy decreases the server load, reduces the traffic from streaming server to proxy, and improves client start-up latency.

A Survey of Edge Caching:Key Issues and Challenges

With the rapid development of mobile communication technology and intelligent applications,the quantity of mobile devices and data traffic in networks have been growing exponentially,which poses a great burden to networks and brings huge challenge to servicing user demand.Edge caching,which utilizes the storage and computation resources of the edge to bring resources closer to end users,is a promising way to relieve network burden and enhance user experience.In this paper,we aim to survey the edge caching techniques from a comprehensive and systematic perspective.We first present an overview of edge caching,summarizing the three key issues regarding edge caching,i.e.,where,what,and how to cache,and then introducing several significant caching metrics.We then carry out a detailed and in-depth elaboration on these three issues,which correspond to caching locations,caching objects,and caching strategies,respectively.In particular,we innovate on the issue“what to cache”,interpreting it as the classification of the“caching objects”,which can be further classified into content cache,data cache,and service cache.Finally,we discuss several open issues and challenges of edge caching to inspire future investigations in this research area.

A Caching Strategy Based on Many-to-Many Matching Game in D2D Networks

Wireless edge caching has been proposed to reduce data traffic congestion in backhaul links, and it is being envisioned as one of the key components of next-generation wireless networks. This paper focuses on the influences of different caching strategies in Device-to-Device(D2D) networks. We model the D2D User Equipments(DUEs) as the Gauss determinantal point process considering the repulsion between DUEs, as well as the caching replacement process as a many-to-many matching game. By analyzing existing caching placement strategies, a new caching strategy is proposed, which represents the preference list of DUEs as the ratio of content popularity to cached probability. There are two distinct features in the proposed caching strategy.(1) It can cache other contents besides high popularity contents.(2) It can improve the cache hit ratio and reduce the latency compared with three caching placement strategies: Least Recently Used(LRU), Equal Probability Random Cache(EPRC), and the Most Popular Content Cache(MPC). Meanwhile, we analyze the effect of caching on the system performance in terms of different content popularity factors and cache capacity. Simulation results show that our proposed caching strategy is superior to the three other comparison strategies and can significantly improve the cache hit ratio and reduce the latency.

QoE-based video segments caching strategy in urban public transportation system

With the rapid development of vehicle-based applications, entertainment videos have gained popularity for passengers on public vehicles. Therefore, how to provide high quality video service for passengers in typical public transportation scenarios is an essential problem. This paper proposes a quality of experience(QoE)-based video segments caching(QoE-VSC) strategy to guarantee the smooth watching experience of passengers. Consequently, this paper considers a jointly caching scenario where the bus provides the beginning segments of a video, and the road side unit(RSU) offers the remaining for passengers. To evaluate the effectiveness, QoE hit ratio is defined to represent the probability that the bus and RSUs jointly provide passengers with desirable video segments successfully. Furthermore, since passenger volume change will lead to different video preferences, a deep reinforcement learning(DRL) network is trained to generate the segment replacing policy on the video segments cached by the bus server. And the training target of DRL is to maximize the QoE hit ratio, thus enabling more passengers to get the required video. The simulation results prove that the proposed method has a better performance than baseline methods in terms of QoE hit ratio and cache costs.