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

为了提升用户体验,降低运营商的成本,将播放最多的视频内容提前放入用户侧缓存是业界的通用做法,如何有效预测视频播放热度已经成为业界热点问题。针对传统预测算法非线性映射能力差、预测精度低及自适应性弱等缺点,提出基于神经网络与马尔可夫组合模型的视频流行度预测算法（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.     

Cache Optimization on Hot‐Point Proxy Caching Using Weighted‐Rank Cache Replacement Policy

The development of proxy caching is essential in the area of video‐on‐demand (VoD) to meet users' expectations. VoD requires high bandwidth and creates high traffic due to the nature of media. Many researchers have developed proxy caching models to reduce bandwidth consumption and traffic. Proxy caching keeps part of a media object to meet the viewing expectations of users without delay and provides interactive playback. If the caching is done continuously, the entire cache space will be exhausted at one stage. Hence, the proxy server must apply cache replacement policies to replace existing objects and allocate the cache space for the incoming objects. Researchers have developed many cache replacement policies by considering several parameters, such as recency, access frequency, cost of retrieval, and size of the object. In this paper, the Weighted‐Rank Cache replacement Policy (WRCP) is proposed. This policy uses such parameters as access frequency, aging, and mean access gap ratio and such functions as size and cost of retrieval. The WRCP applies our previously developed proxy caching model, Hot‐Point Proxy, at four levels of replacement, depending on the cache requirement. Simulation results show that the WRCP outperforms our earlier model, the Dual Cache Replacement Policy.     

基于查询优化策略的语义缓存谓词化简

语义缓存技术可以有效地支持移动计算应用。现有的语义缓存查询处理算法在时空效率和裁剪的复杂度上较高,限制了语义缓存的实用性。为此,本文提出20条逻辑规则和语义缓存动态合并策略,来降低查询裁剪的复杂性。在Android系统上的实验表明,在简单查询下,采用全合并的缓存管理策略和谓词析取式优化算法相结合的方法,能较好地优化查询处理。在复杂查询方面,基于谓词复杂度的语义缓存动态合并策略能很好地平衡缓存与查询两端的谓词复杂度,有效地提高语义缓存的查询处理效率。     

基于层次简化的三维场景快速绘制方法

实时三维场景快速绘制是实现漫游和仿真的基础,提出了一种基于分层简化和碰撞检测的快速渲染算法．该算法先采用八叉树的分层简化三维场景模型,然后用包围盒实现视景的实时碰撞检测,最后采用基于场景剔除的图像缓存技术．从实验结果分析,此方法在效率和显示效果上是可行的．