检索结果-内蒙古大学图书馆

On Resource Pooling and Separation for LRU caching

Performance Evaluation Review 2018年第1期46卷 27-27页

作者： Tan, Jian Quan, Guocong Ji, Kaiyi Shroff, Ness Ohio State University ColumbusOH United States

caching systems using the Least Recently Used (LRU) principle have now become ubiquitous. A fundamental question for these systems is whether the cache space should be pooled together or divided to serve multiple flows of data item requests in order to minimize the miss probabilities. In this paper, we show that there is no straight yes or no answer to this question, and depends on complex combinations of critical factors, including, e.g., request rates, overlapped data items across different request flows, data item popularities and their sizes. To this end, we characterize the performance of multiple flows of data item requests under resource pooling and separation when the cache size is large. Analytically we show that it is asymptotically optimal to jointly serve multiple flows if their data item sizes and popularity distributions are similar, and their arrival rates do not differ significantly;the self-organizing property of LRU caching automatically optimizes the resource allocation among them asymptotically. Otherwise, separating these flows could be better, e.g., when data sizes vary significantly. We also quantify critical points beyond which resource pooling is better than separation for each of the flows when the overlapped data items exceed certain levels. These results provide new insights on the performance of caching systems. © 2018 ACM.

关键词： caching algorithm LRU memcached miss probability

来源：评论

学校读者我要写书评

暂无评论

Joint caching and Sleep-Active Scheduling for Energy-Harvesting Based Small Cells 9

Joint Caching and Sleep-Active Scheduling for Energy-Harvest...

引用

9th International Conference on Wireless Communication and Signal Processing (WCSP)

作者： Xu, Dan Jin, Hao Zhao, Chenglin Liang, Dong Beijing Univ Posts & Telecommun Key Lab Universal Wireless Commun Minist Educ Beijing 100876 Peoples R China

ISBN: (纸本)9781538620625

The massive demand of mobile data traffic stimulates the emergence of cache-enabled heterogeneous cellular networks (HetNets). caching at the network edge can reduce the duplicated transmissions of the contents and improve users' quality of service (QoS), however, the dense deployment of cache-enabled small base stations (SBSs) and relays poses a challenge on energy consumption. Several emerging technologies have been focused on energy savings, such as energy harvesting and dynamic sleep mode operation of base stations (BSs). How to utilize these technologies to optimize energy consumption in cache-enabled HetNet is a hot research topic. Therefore, in this paper, a two-tier caching framework incorporating energy harvesting and sleep mechanism is proposed and joint optimization of energy-efficient sleeping and caching in the energy-harvesting based HetNet is studied. The optimization problem is formulated, aiming at maximizing energy savings in the system, which combines content placement with sleep-active scheduling for self-powered SBSs. To solve the problem, a dynamic energy-harvesting based caching algorithm with sleep-active scheduling mechanism called DECAS is proposed. Simulation results show that by using renewable energy and sleep mechanism, the proposed caching algorithm achieves significant performance gains on energy consumption and maintains high hit ratio, compared with the caching algorithms without joint optimization of energy-harvesting and sleep mechanism.

关键词： HetNets caching algorithm Energy saving Energy harvesting Sleep mechanism

来源：评论

学校读者我要写书评

暂无评论

Lazy caching: A Novel Proxy caching algorithm for Peer-to-Peer Live Streaming

Lazy Caching: A Novel Proxy Caching Algorithm for Peer-to-Pe...

引用

IEEE International Conference on Communications

作者： Haibin Zhai Albert K. Wong Li Lu Hai Jiang Jun Li Zhongcheng Li Institute of Computing Technology Chinese Academy of Sciences Hong Kong University of Science and Technology Guangzhou Research Institute China Telecom

ISBN: (纸本)9781457720529

Peer-to-Peer (P2P) live streaming systems are becoming popular and are imposing a heavy burden on Internet Services Providers (ISPs). Proxy caching has been shown to be an effective means of reducing operation costs for ISPs. Although many caching algorithms for conventional web applications and P2P file sharing systems have been proposed and deployed, there have been few works on the caching for P2P live streaming. Data requests in P2P live streaming have distinct characteristics;for example, they are concentrated in a limited window which progresses rapidly with time in a monotonic mode. In this paper, we propose a novel caching algorithm for P2P live streaming called Lazy caching (LC), which is designed based on the characteristics of P2P live streaming. In LC, data requests that encounter cache misses are stored in a Request Buffer (RB) that is processed periodically. LC can better utilize the cache space than traditional caching algorithms at the cost of introducing a response latency which is at most one RB processing period. Experimental results show that the hit ratio of LC, at a processing period of 0.5 second, can be as much as 20 percent higher than that of SLW, and 9 percent higher than that of OPT. We believe that it is worthwhile to achieve this higher hit ratio at the cost of a small response latency increase.

关键词： Peer-to-peer live streaming Proxy cache caching algorithm Cache memory peer to peer file sharing Streaming P2RY4 gene PROXY CACHE Response Latency internet service providers line controller Perennial Streams peer to peer

来源：评论

学校读者我要写书评

暂无评论

A POMDP-based caching algorithm for RAM of Steaming Media Servers

A POMDP-based Caching Algorithm for RAM of Steaming Media Se...

引用

第三十一届中国控制会议

作者： WU Xumin~1,YIN Baoqun~(1,2),ZHANG Guorong~1,ZHANG Haipeng~1 1.Key Lab of Anhui Network Communication System and Control, University of Science and Technology of China,Hefei 230027,PRC 2.National Network New Media Engineering Research Center, Institute of Acoustics,Chinese Academy of Science,Beijing 100190,PRC

Streaming media servers need to acquire data from local disk *** of the much lower reading/writing speed of disk than random access memory(RAM),good RAM caching policy can efficiently reduce disk I/*** traditional technique is using a greedy and suboptimal algorithm based on the 0-1 knapsack problem *** this paper we propose a partially observable Markov decision process(POMDP) model for the caching *** on the model,the method of event-based optimization is applied in search of optimal randomized *** disk I/O,as the long-run average performance measure of a Markov chain,is optimized via applying the policy-gradient *** simulation results illustrate that the requiring data could be predicted better and lower disk I/O could be achieved by using the proposed method.

关键词： Event-based optimization POMDP caching algorithm

来源：评论

学校读者我要写书评

暂无评论

Constant Time, Fixed Memory, Zero False Negative Error Logging for Low Power Wearable Devices

Constant Time, Fixed Memory, Zero False Negative Error Loggi...

引用

IEEE Conference on Wireless Sensors (ICWiSe)

作者： Doolan, Saffiyah Hosein, Nicholas Hosein, Patrick Bhagwandin, Devika Univ West Indies Dept Comp Sci St Augustine Trinidad Tobago

ISBN: (纸本)9781538619711

Wireless wearable embedded devices dominate the Internet of Things (IoT) due to their ability to provide useful information about the body and its local environment. The constrained resources of low power processors, however, pose a significant challenge to run-time error logging and hence, product reliability. Error logs classify error type and often system state following the occurrence of an error. Traditional error logging algorithms attempt to balance storage and accuracy by selectively overwriting past log entries. Since a specific combination of firmware faults may result in system instability, preserving all error occurrences becomes increasingly beneficial as IOT systems become more complex. In this paper, a novel hash-based error logging algorithm is presented which has both constant insertion time and constant memory while also exhibiting no false negatives and an acceptable false positive error rate. Both theoretical analysis and simulations are used to compare the performance of the hash-based and traditional approaches.

关键词： Error Logging Hashing Wearable Devices, Embedded Devices Body Sensors caching algorithm

来源：评论

学校读者我要写书评

暂无评论

Hybrid storage-based caching strategy for content delivery network services

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2015年第5期74卷 1697-1709页

作者： Kim, Taekook Kim, Eui-Jik Korea Univ Dept Elect Engn Seoul 136713 South Korea Hallym Univ Dept Convergence Software Chuncheon Si 200702 Gangwon Do South Korea

This study proposes a novel caching scheme for content delivery network services. In general, video content users often watch the first part of video clips and then switch to other content. Therefore, a caching scheme is proposed, in which the first part of the frequently referenced content is stored on a solid state drive (SSD) while the remaining video content is stored on a hard disk drive (HDD),. The proposed hybrid (SSD/HDD) caching scheme offers several benefits, such as an improved average data output capacity due to the high average data rate and average hit capacity of the SSD. That is, performance can be significantly improved at a low extra cost with the cache server of a content delivery network (CDN).

关键词： Content delivery network (CDN) Content distribution network (CDN) caching scheme caching algorithm Solid state drive (SSD) Future internet YouTube

来源：评论

学校读者我要写书评

暂无评论

A Clustered caching Placement in Heterogeneous Small Cell Networks with User Mobility 15

A Clustered Caching Placement in Heterogeneous Small Cell Ne...

引用

IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)

作者： Keshavarzian, Iman Zeinalpour-Yazdi, Zolfa Tadaion, Aliakbar Yazd Univ Dept Elect & Comp Engn Yazd Iran

ISBN: (纸本)9781509004805

We consider the content caching problem in a set of the clustered small cells (SCs) in the heterogeneous network. Heterogeneous small cell networks is a promising solution to overcome the explosive growth of the mobile data traffic. A bottleneck of this solution is the capacity of backhaul links between small cells and the network core. However, an alternative solution is using SCs with low rate backhaul links which are equipped with storage devices to cache the popular files. We group SCs into some clusters based on the geographical situation. Each cluster has a cumulative cache storage which is the summation of the cache storage of SCs encountered at that cluster. During one time slot, users in a cluster can download the desired files from the cumulative cache storage of the cluster. Since users may move and change their positions, we model the problem of cluster cache placement as a discrete Markov chain. As the optimum caching placement problem is NP-hard, we provide an appropriate lower bound that guarantees 1/k optimal solution where k is the random walk step of the user's movement. Further, we derive a polynomial time approximation solution with 1/2k2 performance for a situation which the information about the mobility pattern of mobile users in the wireless cell does not exist. Through some simulation examples, we compare the proposed algorithms with an existing solution using real wireless data.

关键词： caching algorithm Small cell heterogeneous network Optimization problem

来源：评论

学校读者我要写书评

暂无评论

Proposta de algoritmo de cacheamento para proxies VoD e sua avaliação usando um novo conjunto de métricas

Proposta de algoritmo de cacheamento para proxies VoD e sua ...

引用

作者： Neves, Bruno Silveira

Today, Video on Demand (VoD) is a digital service on the rise that requires a lot of resources for its implementation. To reduce the costs of running this service, one of the commonly used alternatives is using proxies that cache the most important portions of the collection in order to meet the demand for this content in place of the primary server of the VoD system. In this context, to improve the efficiency of proxy, we proposed a novel caching algorithm that explores the positioning of the active clients to determine the density of clients inside a time window existing in front of each video chunk. By caching the video chunks with the greater density in front of them, the algorithm is able to achieve high performance, in terms of the hit ratio for the requests received by the proxy, during periods of high workload. To better evaluate our approach, we compare it with others of similar nature, using both traditional metrics like hit rate, as well as physical metrics, such as the use of processing resources. The results show that the new algorithm exploits the processing bandwidth available in the underlying architecture of the proxy for obtaining a larger hit rate in comparison to the other algorithms used in the comparative analysis. Finally, to dispose of the necessary tools to perform this analysis, we produced another important contribution in this work: the implementation of a VoD proxy simulator that, to the best of our knowledge, is the first one to enable the evaluation of the hardware used to implement this application. ...

关键词： Microeletrônica Video Proxy Algorítmo caching algorithm Tese

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Local caching Replacement Policies for Internet Video Streaming Services 22

Performance Analysis of Local Caching Replacement Policies f...

引用

22nd International Conference on Software, Telecommunications and Computer Networks (SoftCOM)

作者： Li, Jie Wu, Jinlong Dan, Gyorgy Arvidsson, Ake Kihl, Maria Acreo Swedish ICT AB Networking & Transmiss Lab Kista Sweden KTH Royal Inst Technol Sch Elect Engn Stockholm Sweden Ericsson AB Stockholm Sweden Lund Univ Dept Elect & Informat Technol Lund Sweden

ISBN: (纸本)9789532900521

In this work, the performance of 5 representative caching replacement policies was investigated and compared for caching Internet video-on-demand (VoD) in local access networks. Two measured traces of end-user requests were used in the analyses for two typical VoD services: TV-on-demand and user generated content represented by YouTube. The studied policies range from simple least recently used (LRU) and least frequently used (LFU) algorithms to more advanced ones denoted as LFU-dynamic lifespan (LFU-DL), Adaptive replacement cache (ARC) and Greedy-dual size frequency (GDSF). Our results show that the ARC policy always outperforms the other policies due to its adaptive nature and its ability to track changes in the traffic patterns. On the other hand, the simple LRU policy can also achieve a caching performance which is comparable to that of the more advanced ARC policy especially for the TV-on-demand service when the potential caching gain is high. On the contrary, the simple LFU policy always shows the poorest performance. However, by applying a proper lifespan supplement under the LFU-DL policy, the caching performance can be effectively enhanced to the level achievable using ARC and LRU policies. Moreover, the GDSF policy does not outperform simple LRU or LFU-DL, especially for YouTube video clips when the potential caching gain is relatively low. The advantage of GDSF manifested in our analysis is, however, its outstanding cache space usage efficiency among the five studied caching algorithms.

关键词： Video-on-demand cache caching replacement policy caching algorithm TV-on-demand YouTube local access network

来源：评论

学校读者我要写书评

暂无评论

A Selective caching Scheme Based on Request History in Content-Centric Networks 13

A Selective Caching Scheme Based on Request History in Conte...

引用

ACM International Conference on Emerging Networking Experiments and Technologies (CoNEXT)

作者： Kawano, Takahiro Shimamura, Masayoshi Koga, Hiroyuki Univ Kitakyushu Kitakyushu Fukuoka Japan Tokyo Inst Technol Tokyo 152 Japan

ISBN: (纸本)9781450325752

Content-Centric Networks (CCNs) promise to deliver content in a better way than today's Internet. In CCNs, efficient content delivery services can be achieved by using cache storage on routers. However, an effective caching scheme in CCNs is never established, because the communication method in CCNs differs from that in traditional networks. Therefore, we propose a selective caching scheme which only caches content likely to be used next. Furthermore, we show its effectiveness through simulations.

关键词： caching scheme caching algorithm Content delivery service CCN ICN

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：