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

Dynamic Probabilistic caching algorithm with Content Priorities for Content-Centric Networks

ETRI JOURNAL 2017年第5期39卷 695-706页

作者： Sirichotedumrong, Warit Kumwilaisak, Wuttipong Tarnoi, Saran Thatphitthukkul, Nattanun King Mongkuts Univ Technol Thonburi Dept Elect & Telecommun Engn Bangkok Thailand CPPC Publ Co Ltd Dept Informat Technol Bangkok Thailand Natl Elect & Comp Technol Ctr Accessible Innovat & Universal Design Lab Pathum Thani Thailand

This paper presents a caching algorithm that offers better reconstructed data quality to the requesters than a probabilistic caching scheme while maintaining comparable network performance. It decides whether an incoming data packet must be cached based on the dynamic caching probability, which is adjusted according to the priorities of content carried by the data packet, the uncertainty of content popularities, and the records of cache events in the router. The adaptation of caching probability depends on the priorities of content, the multiplication factor adaptation, and the addition factor adaptation. The multiplication factor adaptation is computed from an instantaneous cache-hit ratio, whereas the addition factor adaptation relies on a multiplication factor, popularities of requested contents, a cache-hit ratio, and a cache-miss ratio. We evaluate the performance of the caching algorithm by comparing it with previous caching schemes in network simulation. The simulation results indicate that our proposed caching algorithm surpasses previous schemes in terms of data quality and is comparable in terms of network performance.

关键词： Addition factor adaptation caching algorithm Content-centric network Content popularity Data priority Multiplication factor adaptation

来源：评论

学校读者我要写书评

暂无评论

Online caching algorithm for VR Video Streaming in Mobile Edge caching System

引用

MOBILE NETWORKS & APPLICATIONS 2024年 1-13页

作者： Liu, Qiuming Chen, Hao Li, Zihui Bai, Yaxin Wu, Dong Zhou, Yang Jiangxi Univ Sci & Technol Sch Software Engn Nanchang 330013 Peoples R China Nanchang Key Lab Virtual Digital Factory & Cultura Nanchang 330013 Peoples R China State Grid Jiangxi Elect Power Co Informat & Commun Branch Nanchang 330095 Jiangxi Peoples R China

The transmission optimization of VR video streaming can improve the quality of user experience, which includes content prediction optimization and caching strategy optimization. Existing work either focuses on content prediction or on caching strategy. However, in the end-edge-cloud system, prediction and caching should be considered together. In this paper, we jointly optimize the four stages of prediction, caching, computing and transmission in mobile edge caching system, aimed to maximize the user's quality of experience. In terms of caching strategy, we design a caching algorithm VIE with unknown future request content, which can efficiently improve the content hit rate, as well as the durations for prediction, computing and transmission. The VIE caching algorithm is proved to be ahead of other algorithms in terms of delay. We optimize the four stages under arbitrary resource allocation and obtain the optimal results. Finally, under the real scenario, the proposed caching algorithm is verified by comparing with several other caching algorithms, simulation results show that the user's QoE is improved under the proposed caching algorithm.

关键词： VR video streaming Joint optimization caching algorithm Quality of experience Edge computing

来源：评论

学校读者我要写书评

暂无评论

Profit-oriented cooperative caching algorithm for hierarchical content centric networking

引用

IET COMMUNICATIONS 2020年第10期14卷 1524-1533页

作者： Yang, Meiyi Zhang, Mingchuan Zhu, Junlong Liu, Ruoshui Wu, Qingtao Wassell, Ian J. Henan Univ Sci & Technol Coll Informat Engn Luoyang 471023 Peoples R China Univ Cambridge Comp Lab Cambridge CB3 0FD England

Cooperative caching among nodes is a hot topic in Content Centric Networking (CCN). However, the cooperative caching mechanisms are performed in an arbitrary graph topology, leading to the complex cooperative operation. For this reason, hierarchical CCN has received widespread attention, which provides simple cooperative operation due to the explicit affiliation between nodes. In this study, the authors propose a heuristic cooperative caching algorithm for maximising the average provider earned profit under the two-level CCN topology. This algorithm divides the cache space of control nodes into two fractions for caching contents which are downloaded from different sources. One fraction cachesduplicatedcontents and the other cachesuniquecontents. The optimal value of the split factor can be obtained by maximising the earned profit. Furthermore, they also propose a replacement policy to support the proposed caching algorithm. Finally, simulation results show that the proposed caching algorithm can perform better than some traditional caching strategies.

关键词： cache storage Internet telecommunication network topology hierarchical content centric networking caching mechanisms arbitrary graph topology hierarchical CCN caching algorithm two-level CCN topology cache space caching contents fraction caches traditional caching strategies profit-oriented cooperative caching algorithm

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

31st Chinese Control Conference

作者： Wu Xumin Yin Baoqun Zhang Guorong Zhang Haipeng Univ Sci & Technol China Key Lab Anhui Network Commun Syst & Control Hefei 230027 Peoples R China Chinese Acad Sci Inst Acoust Natl Network New Media Engn Res Ctr Beijing 100190 Peoples R China

ISBN: (纸本)9789881563811

Streaming media servers need to acquire data from local disk frequently. Because of the much lower reading/writing speed of disk than random access memory (RAM), good RAM caching policy can efficiently reduce disk I/O. The traditional technique is using a greedy and suboptimal algorithm based on the 0-1 knapsack problem model. In this paper we propose a partially observable Markov decision process (POMDP) model for the caching problem. Based on the model, the method of event-based optimization is applied in search of optimal randomized policy. The disk I/O, as the long-run average performance measure of a Markov chain, is optimized via applying the policy-gradient algorithm. The 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

来源：评论

学校读者我要写书评

暂无评论

A New caching algorithm for Boosting Edge Computing Performance 11

A New Caching Algorithm for Boosting Edge Computing Performa...

引用

11th IEEE Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON)

作者： Zhang, Ziyin Hao, Wei Northern Kentucky Univ Dept Comp Sci Highland Hts KY 41099 USA

ISBN: (纸本)9781728196565

Cloud computing is a rapidly growing technology in recent years. However, as there are a limited number of cloud data centers across the world, accessing a distant cloud will cause long response latency. To solve this issue, edge computing has been proposed as one of the most promising approaches. It brings the computing resources geologically closer to end users with reduced access latency. Since the development of edge computing is still at its infancy, there is no mature architecture framework. A three-tiered system architecture is one of the many frameworks proposed. In this paper, a new caching algorithm based on data mining technique was proposed for the three-tiered edge computing architecture. The simulation and experiment results show that equipped with the new caching algorithm, the performance of a web application can be improved using the three-tiered edge computing architecture.

关键词： cloud computing edge computing caching algorithm k-means clustering cache size constraint

来源：评论

学校读者我要写书评

暂无评论

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 (ICC)

作者： Zhai, Haibin Wong, Albert K. Lu, Li Jiang, Hai Li, Jun Li, Zhongcheng Chinese Acad Sci Inst Comp Technol Beijing Peoples R China Hong Kong Univ Sci & Technol Hong Kong Hong Kong Peoples R China Grad Univ Chinese Acad Sci Beijing Peoples R China China Telecom Guangzhou Res Inst Guangzhou Peoples R China

ISBN: (纸本)9781457720536

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

来源：评论

学校读者我要写书评

暂无评论

A Social-Aware caching algorithm for Improving Performance of Online Social Network Services in a Multi-Cloud Environment 17

A Social-Aware Caching Algorithm for Improving Performance o...

引用

3rd International Conference on Communication and Information Processing (ICCIP)

作者： Han, Seunghee Song, JooSeok Yonsei Univ Dept Comp Sci 50 Yonsei Ro Seoul 03722 South Korea

ISBN: (纸本)9781450353656

Existing online social network (OSN) services use caching systems with the least recently used (LRU) algorithm as an eviction policy for improving service performance. However, they do not consider the characteristics of users' usage pattern in OSN services. In addition, they do not consider the fact that the users and cloud servers are geographically distributed over a large area. It makes relatively unnecessary data occupy limited memory space. Consequently, they cannot prevent the degradation of cache efficiency. We introduce a social-aware caching algorithm to improve the performance of OSN services in a multi-cloud environment. Our approach is designed to consider the locations of the user and cloud server and to allocate memory space differently to each user by considering the user's frequency of service usage. To validate our approach, we implemented a OSN service that manages user data in the same way as Twitter that is a representative OSN service. Furthermore, we experimented with actual users' locations and times of use as collected from Twitter. Our findings indicate that this approach can improve the cache hit ratio by an average of more than 24% and reduce the execution delay by an average of more than 1095 ms.

关键词： Cache caching algorithm online social network (OSN) cloud multi-cloud multiple clouds

来源：评论

学校读者我要写书评

暂无评论

A Proxy caching algorithm Based on Popularity for Streaming Media

A Proxy Caching Algorithm Based on Popularity for Streaming ...

引用

9th International Conference on Natural Computation (ICNC)

作者： Yang, Ge Beijing Normal Univ Coll Informat Sci & Technol Beijing 100875 Peoples R China

ISBN: (纸本)9781467347143

A novel proxy caching algorithm P(2)CASM (Proxy caching algorithm Based on Popularity for Streaming Media) based on segment popularity for streaming media was proposed. A proxy caching admission and replacement algorithm based on the segment popularity for streaming media objects was implemented. The principle was obeyed that the data cached for each streaming media objects were in proportion to their popularity on the proxy server. The size of the caching window was updated periodically according to the average access time of the clients. P2P replica could be cached on a P2P proxy. Simulation results showed that this algorithm was more adaptive than A(2)LS (Adaptive and Lazy Segmentation algorithm) algorithm for the variety of the proxy server cache. It could gain more average number of cached streaming media objects and less delayed requested ratio while byte-hit ratio of P(2)CASM algorithm was close to or exceeded A(2)LS algorithm under the circumstance of the same proxy cache space.

关键词： streaming media replication technology caching algorithm segment popularity

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：