基于辅助设备的D2D集群的文件块缓存策略研究

为了解决D2D缓存命中概率的最优化问题,在集群用户中加入了移动辅助设备(HEs)缓存,同时,提出了基于辅助设备的D2D集群的流性文件块分批缓存策略(FCPhit):首先,将有相似文件请求的用户群置于一个集群中;然后,将用户分批并将流行文件分为若干块,用户设备缓存文件的第1块,移动辅助设备缓存其他文件块. 并与已有的最流行缓存策略(MPhit)、最优缓存策略(OCPhit)和等概率缓存策略(EPRC)进行对比实验,结果表明:FCPhit策略可以有效提高系统的缓存命中概率.     

An Optimal Content Caching Framework for Utility Maximization

For desirable quality of service, content providers aim at covering content requests by large network caches. Content caching has been considered as a fundamental module in network architecture. There exist few studies on the optimization of content caching. Most existing works focus on the design of content measurement,and the cached content is replaced by a new one based on the given metric. Therefore, the performance for service provision with multiple levels is decreased. This paper investigates the problem of finding optimal timer for each content. According to the given timer, the caching policies determine whether to cache a content and which existing content should be replaced, when a content miss occurs. Aiming to maximize the aggregate utility with capacity constraint, this problem is formalized as an integer optimization problem. A linear programming based approximation algorithm is proposed, and the approximation ratio is proved. Furthermore, the problem of content caching with relaxed constraints is given. A Lagrange multiplier based approximation algorithm with polynomial time complexity is proposed. Experimental results show that the proposed algorithms have better performance.     

应用控制的Web服务器磁盘缓冲方法

针对大数据负载时磁盘I／O阻塞造成的Web服务器性能下降的问题，提出了应用程序控制缓冲（ACC）方法．其核心是，缓冲跟踪模块根据应用程序的文件访问过程来跟踪内核中的文件缓冲状态，缓冲控制模块进行缓冲替换和预取，保持文件缓冲有足够的空闲空间．这样，服务器可在用户空间控制文件缓冲，从而准确判断文件是否在缓冲之中，并依此来调度请求，以提高处理器和磁盘的I／O并行度．同时，服务器可采用适应自身特点的缓冲和预读策略，以提高缓冲的命中率．作为示例，将ACC在Flash服务器中实现，实现中选用了“金字塔选择”缓冲算法．实验表明，在大数据负载下使用ACC的Flash服务器性能有很大的提高，即便在数据负载稍大于物理内存空间的情况下，服务器的吞吐率仍可提高约24．4％，而当数据负载超出物理内存2～3倍时，吞吐率可提高3～4倍。     

基于缓存开销的信息中心网络缓存协作策略

网络化缓存策略影响ICN网络的传输性能,考虑到缓存执行时的开销不仅包含访问缓存节点时的路径代价,还应包含替换旧信息的替换代价,因此提出一种基于路径访问代价和节点替换代价的缓存协作策略(path and node cost based cooperative caching strategy, 简称PNC3S).该策略对两种代价进行整体考虑,将代价总量作为是否进行信息与节点匹配缓存的依据,对提出的策略模型进行优化分析,将最优解作为缓存部署方案.实验结果表明,与CEE,LCD策略相比,PNC3S可以改善网络的信息缓存率、服务器的负载率、网络链路平均利用率,以及访问跳数减少率.     

基于价值预评估的代理服务器缓存策略

传统方法解决代理服务器内存空间不足的问题都是被动性方法,在没有考虑缓存对象的缓存价值的情况下直接对它们做缓存,在代理服务器内存不够时再将它们替换,使得部分无缓存价值的对象毫无效果地被缓存了一遍.本文引入了缓存的准入机制,提出基于价值预评估的缓存策略,描述了缓存价值的预评估算法,仿真实验结果表明采用本缓存策略的系统运行有较高的文档命中率和字符命中率.     

The Configuration Strategies on Caching for Web Servers

The Web cluster has been a popular solution of network server system because of its scalability and cost effective ness. The cache configured in servers can result in increasing significantly performance, In this paper, we discuss the suitable configuration strategies for caching dynamic content by our experimental results. Considering the system itself can provide support for caching static Web page, such as computer memory cache and disk＇s own cache, we adopt a special pattern that only caches dynamic Web page in some experiments to enlarge cache space. The paper is introduced three different replacement algorithms in our cache proxy module to test the practical effects of caching dynamic pages under different conditions. The paper is chiefly analyzed the influences of generated time and accessed frequency on caching dynamic Web pages. The paper is also provided the detailed experiment results and main conclusions in the paper.     

基于 P2P的VOD系统中数据缓存策略研究

提出了一种结合内存缓存与磁盘缓存的新型缓存策略.该策略在原有内存缓存基础上增加了磁盘缓存,数据从内存中被淘汰时,从磁盘缓存空间中选择合适磁盘分片进行缓存,并建立索引管理已缓存数据,使对等网络中的节点利用彼此的闲置磁盘资源缓存更多的媒体数据,服务器的负载得到有效降低,节点在对等网络中从其他节点获取数据的成功率明显提高.实验证明,该缓存策略有效提高了系统的整体服务能力,充分利用对等网络中的空闲节点资源降低视频服务器的负载.     

基于主动网络的最佳缓存位置计算

主动网络是一种新型的智能性网络,其中的任何一个主动节点都可以用于放置缓存。基于主动网络,通过使用ILP算法,解决了在哪个节点中进行缓存为最佳的问题,从而使整个网络缓存系统的花费较小、效率较高。并使用ANTS对这个算法进行了模拟实现。     

软件定义下的CCN缓存算法研究

为了解决内容中心网络（CCN）中存在的缓存问题,在内容中心网络和软件定义网络（SDN）的融合架构下,充分利用控制层全局感知和集中控制的优势,提出了一种软件定义下的CCN缓存决策方法。考虑了中介中心度、内容流行度、节点边缘度和缓存节点存储容量的有限性,引入了控制节点和通信节点的概念,通过控制器缓存决策,使得请求内容在不同的节点进行合理缓存。同时,根据控制节点距离缓存节点和服务器的跳数,找到返回用户请求的最短路径,采用ndnSIM进行仿真实验。结果表明,相比ALWAYS,LCD两种传统缓存决策策略,该方案可以明显提高缓存命中率,降低路径延展率和缓存替换数,达到了提高CCN缓存效率的目的,有利于内容中心网络及未来网络的发展。     

基于细粒度伪划分的多核私有Cache容量共享机制

针对多核私有Cache结构面临的容量失效问题,提出了一种基于细粒度伪划分的核间容量共享机制.通过在细粒度层次为每个Cache Bank设置加权饱和计数器阵列来统计和预测各线程的访存需求差异情况,控制各个处理器核在每个Cache Set上的私有域与共享域划分比例,并以此指导各处理器核上的牺牲块替换、溢出与接收决策,利用智能的核间容量借用机制来均衡处理器间访存需求差异,缓解多核私有Cache结构面临的容量失效问题.在体系结构级全系统模拟器上的实验结果表明,该机制能够有效改善多核私有Cache结构的容量失效问题,降低多线程应用程序的平均存储访问延迟.     

Planning for the future by western scrub-jays

Knowledge of and planning for the future is a complex skill that is considered by many to be uniquely human. We are not born with it; children develop a sense of the future at around the age of two and some planning ability by only the age of four to five. According to the Bischof-K?hler hypothesis, only humans can dissociate themselves from their current motivation and take action for future needs: other animals are incapable of anticipating future needs, and any future-oriented behaviours they exhibit are either fixed action patterns or cued by their current motivational state. The experiments described here test whether a member of the corvid family, the western scrub-jay (Aphelocoma californica), plans for the future. We show that the jays make provision for a future need, both by preferentially caching food in a place in which they have learned that they will be hungry the following morning and by differentially storing a particular food in a place in which that type of food will not be available the next morning. Previous studies have shown that, in accord with the Bischof-K?hler hypothesis, rats and pigeons may solve tasks by encoding the future but only over very short time scales. Although some primates and corvids take actions now that are based on their future consequences, these have not been shown to be selected with reference to future motivational states, or without extensive reinforcement of the anticipatory act. The results described here suggest that the jays can spontaneously plan for tomorrow without reference to their current motivational state, thereby challenging the idea that this is a uniquely human ability.     

Improved caching policies and hybrid strategy for query result cache

To improve efficiency of search engines,the query result cache has drawn much attention recently.According to the query processing and user' s query logs locality,a new hybrid result cache strategy which associates with caching heat and worth is proposed to compute cache score in accordance with cost-aware strategies.Exactly,query repeated distance and query length factor are utilized to improve the static result policy,and the dynamic policy is adjusted by the caching worth.The hybrid result cache is implemented in term of the document content and document ids(doclds) sequence.Based on a score format and the new hybrid structure,an initial algorithm and a new routing algorithm are designed for result cache.Experiments' results show that the improved caching policies decrease the average response time effectively,and increase the system throughput significantly.By choosing comfortable combination of page cache and doclds cache,the new hybrid caching strategy almost reduces more than 20%of the average query time compared with the basic pageonly cache and docld-only cache.     

对象存储系统的合作缓存方案

结合对象存储系统的数据访问模式,综合设计客户端和元数据服务的缓存,构造存储系统的合作缓存方案.该方案将客户端和元数据服务器的缓存作为整体进行设计,以达到提高缓存利用率的目的;通过缓存准入策略合理选择数据传送模式,减少数据传送的通信量;同时,合作缓存方案根据数据对象的大小、访问成本和网络负载动态地调整缓存策略,提高存储系统的服务质量.实验显示,合作缓存方案能较好地适应不同的工作负载,有效提高了系统的输入输出性能.     

基于遗传-粒子群优化算法带有缓存机制的卸载策略

为了满足移动边缘计算(Mobie Edge Computing,MEC)场景中时延敏感型应用的需求,提出一种基于遗传-粒子群优化算法(Genetic-Particle Swarm Optimization Algorithm,GA-PSO)和缓存机制的卸载策略。该策略将遗传算法和粒子群优化(Particle Swarm Optimization,PSO)算法融合起来,以便求取边缘计算卸载中的最优卸载比例和缓存决策;将已完成且重复请求的任务及相关数据在边缘云上进行缓存,用以最小化任务的卸载时延。仿真实验结果表明,该策略可以有效降低移动边缘计算的时延。     

并行文件系统客户端缓存对系统I/O性能的影响

对浪潮天梭并行文件系统(LCTS-PFS)客户端缓存性能进行了测试,提出了多客户端访问、带客户端缓存的并行文件系统排队模型.分析了不同缓存命中率、不同缓存空间大小和不同文件长度情况下,客户端缓存对I/O响应时间的影响.分析结果表明:I/O响应时间随缓存命中率提高而减少且在有/无缓存情况下的I/O响应时间曲线存在唯一交点,在此交点之前无缓存情况下I/O响应时间小于有缓存情况,而交点之后结果相反;缓存命中率不发生变化时,缓存空间越大I/O响应时间越长;相比无缓存情况下I/O响应时间,若客户端请求生成率固定,则访问文件越大,缓存对I/O响应时间提升越少;若请求生成率发生变化,则相同缓存命中率情况下,访问的文件越大缓存对I/O响应时间提升越多.性能测试和理论分析一致.     

Semantic Cache Replacement Strategy for XML Algebra-Based Query Optimization

Aiming at the fact that traditional cache replacement strategy lacks pertinence to the semantic cache in the process of extensible markup language(XML) algebra query, a replacement strategy based on the semantic cache contribution value is proposed. First, pattern matching rules for XML algebra query and semantic caches are given. Second, the method of calculating the semantic cache contribution value is proposed. In XML documents with four different sizes, the experimental results of time efficiency show that this strategy supports environment of the XML algebra query and it has better time efficiency than both least frequency used(LFU) and least recently used(LRU).     

缓存辅助移动边缘计算的任务卸载与资源分配联合优化策略

为了减少资源受限的移动边缘计算场景下任务卸载和资源分配过程中的能量消耗,提出缓存辅助的动态卸载决策和计算、通信、缓存多维资源分配的联合优化策略。该策略根据任务流行度制定缓存服务,通过控制用户设备的发射功率优化通信资源分配,并结合计算卸载合理利用服务器的计算资源。提出最小化时延和能耗的均衡优化目标,设计基于深度强化学习的优化求解算法。最后,通过仿真实验验证所提策略的有效性,结果表明该策略在计算资源和缓存容量约束条件下能展现较优性能。     

基于分段的适应性流媒体缓存管理算法

为提高流媒体代理服务器的缓存效率,从而提高整个流媒体服务系统的性能,提出一种基于用户访问模式的适应性媒体分段缓存策略。该策略充分考虑用户行为模式对具体影片访问特性的不同,采取有针对性的分段缓存管理策略,可显著提高代理缓存命中率。为避免由于分段策略所潜在引发的播放抖动问题,对相应的预取算法进行了理论分析。事件驱动试验结果表明:所提出的缓存算法命中率较之传统的定长分段算法及系统现有的间隔缓存策略均有显著的性能提高,系统稳定时缓存命中率分别高出后两者54%和31%。     

基于分段的适应性流媒体缓存管理算法

为提高流媒体代理服务器的缓存效率,从而提高整个流媒体服务系统的性能,提出一种基于用户访问模式的适应性媒体分段缓存策略。该策略充分考虑用户行为模式对具体影片访问特性的不同,采取有针对性的分段缓存管理策略,可显著提高代理缓存命中率。为避免由于分段策略所潜在引发的播放抖动问题,对相应的预取算法进行了理论分析。事件驱动试验结果表明:所提出的缓存算法命中率较之传统的定长分段算法及系统现有的间隔缓存策略均有显著的性能提高,系统稳定时缓存命中率分别高出后两者54%和31%。     

ORM中基于语义相似性的查询缓存替换策略

针对查询的时间局部性特点, 提出基于语义缓存查询SC(semantic comparability)替换策略. 该策略通过分析缓存项与查询项在关系、条件及查询属性3个方面的相关性, 并结合数据访问频率将相似性最小的缓存项予以淘汰. 实验结果表明, 基于查询序列的先后关系, 有选择性的保留与查询具有继承、关联等关系的缓存项, 能够得到更高的查询命中率及更短的查询响应时间. 在缓存空间相同的情况下, SC策略优于LRU策略.