Impacts of user-selfishness on cooperative content caching in social wireless networks

Cooperative caching can be an effective mechanism for reducing electronic content provisioning cost in Social Wireless Networks (SWNETs). These networks are formed by a collection of mobile data enabled devices physically gathering in settings such as university campus, malls, airport and other public places. In this paper, we first propose an optimal collaborative object caching policy in order to minimize the object provisioning cost in SWNETs with homogenous user requests and a peer-rebate model for promoting collaboration. Then using an analytical model we study the impacts of user selfishness on the provisioning cost and the earned rebate when certain nodes in an SWNET selfishly deviate from the optimal policy. User selfishness is motivated in order to either increase individually earned rebate or to reduce content provisioning cost. The analytical model is validated by experimental results from simulated SWNETs using the network simulator ns2.     

An altruistic cross‐layer recovering mechanism for ad hoc wireless networks

Video streaming services have restrictive delay and bandwidth constraints. Ad hoc networks represent a hostile environment for this kind of real‐time data transmission. Emerging mesh networks, where a backbone provides more topological stability, do not even assure a high quality of experience. In such scenario, mobility of terminal nodes causes link breakages until a new route is calculated. In the meanwhile, lost packets cause annoying video interruptions to the receiver. This paper proposes a new mechanism of recovering lost packets by means of caching overheard packets in neighbor nodes and retransmit them to destination. Moreover, an optimization is shown, which involves a video‐aware cache in order to recover full frames and prioritize more significant frames. Results show the improvement in reception, increasing the throughput as well as video quality, whereas larger video interruptions are considerably reduced. Copyright © 2014 John Wiley & Sons, Ltd.     

一种有资源适应性的transcoding代理缓存机制

在基于transcoding代理的流媒体服务系统中,CPU和网络是两种潜在的瓶颈资源.本文提出了一种有资源适应性的transcoding代理缓存机制,统一考虑CPU和网络的资源需求,以提高系统的服务能力.首先推导了多版本缓存策略下网络收益和CPU收益的计算方法.通过引入一个时变的影响因子 α (t),给出了缓存系统聚合资源收益的表达.在此基础上给出了单个对象的缓存价值函数,并设计了RAC替换算法.实验表明RAC具有较好的资源适应性和系统吞吐率.     

基于单片机控制的高速数据采集与处理系统研究

针对现有单片机的数据处理速率较低不利于高速数据采集与处理的问题,文中研究并设计基于单片机控制的高速数据采集与处理系统。在数据采集方面,使用A/D高速采样芯片实现高速数据采集。为满足高速数据处理与存储的需要,文中使用PC终端的IDE接口硬盘作为系统的存储装置。另外,为协调数据采集与数据处理过程,使用单片机核心控制模块控制高速双口RAM实现高速数据缓存排队,从而实现数据从A/D采样芯片到IDE硬盘的高速无损传输。该高速数据采集与处理系统在数据采集、处理方面更加集成化,具有较高的工程应用价值。     

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.     

内容中心网络中基于分布式协作的缓存策略

提出了一种应用于内容中心网络的缓存策略,对高热度内容进行分布式缓存,允许缓存节点之间协作,保证热度高的内容在缓存中生存更长的时间,并在内容请求过程中利用跟踪节点实现缓存内容的定位,允许内容请求用户从网络中参与协作的缓存节点获取被请求内容的不同部分,达到分布式缓存协作的目的,提高网络中缓存资源的利用率,降低内容请求用户获取内容的时间. 仿真结果表明,该策略能有效减少网络的平均时延.     

基于相关性概率的信息中心网络协作缓存策略

信息中心网络(ICN)的节点缓存功能有助于海量内容的高效分发,缓解链路拥塞并减少流量冗余. 传统的缓存策略不利于提高全网缓存的内容多样性和缓存节点的平均命中率,现有研究能在一定程度上解决这些问题,实现了公平的内容流复用,但没有充分考虑节点之间的协作,导致节点缓存的利用率不均. 为了解决上述问题,从当前节点缓存状态对其他节点的影响入手,提出一种基于相关性概率的ICN协作缓存策略,根据路径及相邻节点信息做出本节点的缓存判断,从而有效控制缓存冗余. 仿真结果表明,该方法可以减轻服务器负载,丰富全网内容多样性,有利于提高交错复杂网络节点的命中率和利用率,减少请求跳数.     

一种基于朴素贝叶斯算法的OLAP缓存机制

大数据时代,缓存作为一种提高数据处理性能的有效技术而被广泛研究。目前大多数缓存机制将查询结果以文件的形式保存了下来,命中率较低,造成了缓存资源的浪费。以国内外的缓存技术为基础,结合用户的查询习惯,借助增量朴素贝叶斯算法设计了一种新的数据仓库缓存机制,此缓存机制可根据用户的操作习惯判断每次查询的结果是否需要被缓存,以此提高缓存命中率。并通过实验从平均查询时间以及缓存命中率两方面验证了该缓存机制的有效性。     

客户端缓存模拟器的设计与实现

为了分析对比文中提出的预测双缓存模型与传统的点播系统中的缓存模型优缺点以及证明该模型的可行性和正确性,在分析了传统的仿真器的基础上,利用VC开发出了一个适合预测双缓存模型以及传统缓存模型的仿真器.先分析了仿真器的系统结构,对每个模块的实现给出了较为详细的描述,并对所需参数的设置进行了说明.