Cooperative caching game based on social trust for D2D communication networks

Content sharing via device‐to‐device (D2D) communications has become a promising method to increase system throughput and reduce traffic load. Due to the characteristic of spectrum sharing in D2D network, confidentiality is becoming a key issue in content transmission. Secure communication in D2D networks is generally guaranteed by a physical‐layer security mechanism. However, this method sacrifices the system transmission rate while ensuring security. Since mobile devices are carried by humans, we can leverage their trust relations to enhance the security of communications. As much, considering the psychology structure and social attributes of mobile users, we build a multidimensional trust evaluation mechanism to evaluate the trust relationship between users, and we pick out the trusted users based on the decision‐theoretic rough sets. By sharing content only between trust users, we can enhance the security of content transmissions without relying on physical‐layer security measures. Meanwhile, content caching is now widely used to improve accessing efficiency and reduce traffic load on cellular networks. However, caching content for other users incurs additional cost, which results in selfish and noncooperative behavior in users. Considering such selfishness, we introduce a cooperative caching game based on multidimensional trust relations to motivate users to cache contents for other devices. In this game, the trust relations and physical distance between two users are considered to formulate the cost function. Furthermore, we introduce an incentive caching algorithm based on social trust to minimize the total cost in the D2D network.     

Dynamic theoretic proactive caching placement game for energy saving in H‐CRAN

Edge caching is an effective feature of the next 5G network to guarantee the availability of the service content and a reduced time response for the user. However, the placement of the cache content remains an issue to fully take advantage of edge caching. In this paper, we address the proactive caching problem in Heterogeneous Cloud Radio Access Network (H‐CRAN) from a game theoretic point of view. The problem is formulated as a bargaining game where the remote radio heads (RRHs) dynamically negotiate and decide which content to cache in which RRH under energy saving and cache capacity constraints. The Pareto optimal equilibrium is proved for the cooperative game by the iterative Nash bargaining algorithm. We compare between cooperative and noncooperative proactive caching games and demonstrate how the selfishness of different players can affect the overall system performance. We also showed that our cooperative proactive caching game improves the energy consumption of 40% as compared with noncooperative game and of 68% to no‐game strategy. Moreover, the number of satisfied requests at the RRHs with the proposed cooperative proactive caching scheme is significantly increased.     

Packet‐level‐based traffic aggregation to optimize NDN content delivery

In recent years, named data networking (NDN) has been accepted as the most popular future paradigm and attracted much attention, of which the routing model contains interest forwarding and content delivery. However, interest forwarding is far from the bottleneck of routing optimization; instead, the study on content delivery can greatly promote routing performance. Although many proposals on content delivery have been investigated, they have not considered packet‐level caching and deep traffic aggregation, which goes against the performance optimization of content delivery. In this paper, we propose a packet‐level‐based traffic aggregation (PLTA) scheme to optimize NDN content delivery. At first, the packet format is devised, and data plane development kit (DPDK) is used to ensure same size for each packet. Then, the whole delivery scheme with traffic aggregation consideration is presented. The simulation is driven by the real YouTube dataset over Deltacom, NSFNET, and CERNET topologies, and the experimental results demonstrate that the proposed PLTA has better delivery performance than three baselines in terms of cache hit ratio, delivery delay, network load, and energy efficiency.     

基于神经网络与马尔可夫组合模型的视频流行度预测算法

为了提升用户体验,降低运营商的成本,将播放最多的视频内容提前放入用户侧缓存是业界的通用做法,如何有效预测视频播放热度已经成为业界热点问题。针对传统预测算法非线性映射能力差、预测精度低及自适应性弱等缺点,提出基于神经网络与马尔可夫组合模型的视频流行度预测算法（Mar-BiLSTM）,该算法通过构建双向长短期记忆（bi-directional long short-term memory,BiLSTM）网络模型可以保留时间序列两个方向的信息依赖;同时在避免引入外部变量导致模型复杂度增加的情况下,利用马尔可夫性质进一步提高了模型的预测精度。实验结果表明,与传统的时间序列和经典的神经网络算法相比,所提算法提升了视频流行度预测的准确性、时效性,并降低了计算量。     

Cooperative caching for content dissemination in vehicular networks

The explosive growth of mobile data traffic has made cellular operators to seek low‐cost alternatives for cellular traffic off‐loading. In this paper, we consider a content delivery network where a vehicular communication network composed of roadside units (RSUs) is integrated into a cellular network to serve as an off‐loading platform. Each RSU subjecting to its storage capacity caches a subset of the contents of the central content server. Allocating the suitable subset of contents in each RSU cache such that maximizes the hit ratio of vehicles requests is a problem of paramount value that is targeted in this study. First, we propose a centralized solution in which, we model the cache content placement problem as a submodular maximization problem and show that it is NP‐hard. Second, we propose a distributed cooperative caching scheme, in which RSUs in an area periodically share information about their contents locally and thus update their cache. To this end, we model the distributed caching problem as a strategic resource allocation game that achieves at least 50% of the optimal solution. Finally, we evaluate our scheme using simulation for urban mobility simulator under realistic conditions. On average, the results show an improvement of 8% in the hit ratio of the proposed method compared with other well‐known cache content placement approaches.     

信息中心网络体系结构研究综述

互联网应用需求逐渐转变为信息的分发和获取,而网络体系结构依然为主机间的端到端通信,二者矛盾日趋尖锐。信息中心网络（Information-Centric Networking,ICN）采用以信息为中心的设计为解决上述问题提供了新思路。本文提出了ICN的基本体系结构框架,从功能和特性两个维度探索了ICN可能的设计空间,然后讨论了ICN与其他未来网络技术的关系以及ICN实验平台和部署,最后指出当前主要问题及下一步研究方向。     

“疏堵结合”——P2P内容缓存方案

目前P2P技术已经使互联网发生了质的改变。如何合理的利用和管理P2P技术,已经摆了网路运营商面前。本文详细描述了基于"疏堵结合"思想的P2P内容缓存方案。该方案利用智能缓存技术,使P2P流量本地化,解决P2P应用的管理问题。     

Asymptotic optimality of the static frequency caching in the presence of correlated requests

It is well known that the static caching algorithm that keeps the most frequently requested documents in the cache is optimal in case when documents are of the same size and requests are independent and identically distributed. However, it is hard to develop explicit and provably optimal caching algorithms when requests are statistically correlated. In this paper, we show that keeping the most frequently requested documents in the cache is still optimal for large cache sizes even if the requests are strongly correlated.     

土地监察移动数据库技术及其应用

近年来,基于移动数据库的移动GIS技术发展呈加速趋势,并在越来越多领域的应用中取得成功.在土地监察工作中采用移动GIS手段,有利于实现实时、快速执行土地违法勘察、执法动态监察等工作,为建立完善的土地管理长效机制提供技术支持,保障人民群众的利益和社会的稳定.本文先介绍移动数据库的原理和架构,然后结合土地监察实际需求,重点探讨移动数据库在土地监察中需要解决的数据同步、数据复制与缓存和数据安全存储等关键技术问题.     

Pervasive data access in wireless and mobile computing environments

The rapid advance of wireless and portable computing technology has brought a lot of research interests and momentum to the area of mobile computing. One of the research focus is on pervasive data access. With wireless connections, users can access information at any place at any time. However, various constraints such as limited client capability, limited bandwidth, weak connectivity, and client mobility impose many challenging technical issues. In the past years, tremendous research efforts have been put forth to address the issues related to pervasive data access. A number of interesting research results were reported in the literature. This survey paper reviews important works in two important dimensions of pervasive data access: data broadcast and client caching. In addition, data access techniques aiming at various application requirements (such as time, location, semantics and reliability) are covered. Copyright © 2006 John Wiley & Sons, Ltd.