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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

ARMC-RL: Adaptive caching With Reinforcement Learning for Efficient 360° Video Streaming in Edge Networks

引用

IEEE ACCESS 2025年 13卷 88030-88046页

作者： Choi, Minji Park, Somin Ahn, Jin-Hyun Kim, Dong Ho You, Cheolwoo Myongji Univ Dept Informat & Commun Engn Yongin 17058 South Korea Seoul Natl Univ Sci & Technol Dept Elect & IT Media Engn Seoul 139743 South Korea

The growing demand for high-capacity content such as 3D and 360 degrees videos highlights the need for efficient data delivery in B5G/6G networks. Multi-access edge computing (MEC) has emerged as a promising solution, but its limited memory capacity makes cache replacement strategies essential. To address this, we propose an adaptive recency masking caching (ARMC) algorithm for 360 degrees video streaming in MEC environments. The proposed caching mechanism efficiently replaces cached data by combining two techniques: recency masking and Frequency-Filtered Least Recently Used. The use of the techniques is determined by the importance of the cache data and the available cache capacity. In addition, we introduce the concept of an observation window to improve cache performance by reflecting the recency of data request patterns. We conducted experiments using a field of view (FoV) dataset recorded from real users watching videos via head-mounted displays. Given the characteristics of 360 degrees videos, we assumed that the MEC cache would require high-quality tiles matching the user's FoV at each moment. Through experiments, we confirmed that the proposed method achieved a higher cache hit rate compared to existing cache replacement techniques. In particular, ARMC improved the hit rate by up to 29% compared to Least Frequency Used algorithm under constrained cache conditions of 6% or less of the total data. Higher cache hit rates contribute to reducing transmission latency and lowering bandwidth consumption. Meanwhile, the size of the observation window, a key variable in the proposed technique, varied in terms of its optimal size depending on the cache size and user viewing patterns. To address this issue, we proposed ARMC-RL, a variant of ARMC with reinforcement learning (RL) assistance, which is designed to dynamically estimate the optimal observation window size according to the given environment. Based on the experiments, ARMC-RL, depending on the learning model, a

关键词： Streaming media Quality of experience Servers Prediction algorithms Heuristic algorithms Bandwidth Reinforcement learning Clustering algorithms Bit rate Adaptation models Muli-access edge computing caching algorithm 360 degrees video streaming quality of experience video tiling reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Implementation and optimization of SpMV algorithm based on SW26010P many-core processor and stored in BCSR format

引用

SCIENTIFIC REPORTS 2024年第1期14卷 1-13页

作者： Ma, Mengfei Huang, Xianqing Xu, Jiali Jia, Dongning Qingdao Marine Sci & Technol Ctr Informat Res Dept Qingdao Peoples R China Laoshan Lab Qingdao Peoples R China Ocean Univ China Coll Informat Sci & Engn Qingdao Peoples R China

The irregular distribution of non-zero elements of large-scale sparse matrix leads to low data access efficiency caused by the unique architecture of the Sunway many-core processor, which brings great challenges to the efficient implementation of sparse matrix-vector multiplication (SpMV) computing by SW26010P many-core processor. To address this problem, a study of SpMV optimization strategies is carried out based on the SW26010P many-core processor. Firstly, we design a memorized data storage transformation strategy to transform the matrix in CSR storage format into BCSR (Block Compressed Sparse Row) storage. Secondly, the dynamic task scheduling method is introduced to the algorithm to realize the load balance between slave cores. Thirdly, the LDM memory is refined and designed, and the slave core dual cache strategy is optimized to further improve the performance. Finally, we selected a large number of representative sparse matrices from the Matrix Market for testing. The results show that the scheme has obviously speedup the processing procedure of sparse matrices with various sizes and sizes, and the master-slave speedup ratio can reach up to 38 times. The optimization method used in this paper has implications for other complex applications of the SW26010P many-core processor.

关键词： Sparse matrix-vector multiplication caching algorithm SW26010P Block compressed sparse row High performance computing

来源：评论

学校读者我要写书评

暂无评论

TDC: Pool-Level Object Cache Replacement algorithm Based on Temperature Density 1

引用

23rd International Conference on algorithms and Architectures for Parallel Processing (ICA3PP)

作者： Lu, HuaCheng Wang, Yong Chen, JunQi Zhang, DaHuan Li, ZhiKe Guilin Univ Elect Technol Sch Comp & Informat Secur Guilin 541004 Peoples R China Guilin Univ Elect Technol Guangxi Educ Big Data & Cyberspace Collaborat Inn Guilin 541004 Peoples R China

ISBN: (数字)9789819708345

ISBN: (纸本)9789819708338;9789819708345

For mixed HDD and SSD storage scenarios, Ceph Cache Tier provides a tiered caching feature that separates fast and slow storage pools to manage data objects more efficiently. However, due to the limited total capacity of the cache pool, only some data objects can be stored. Performance can be significantly improved when clients focus on accessing hot objects in the cache pool. If a client accesses the cache pool without hitting data, redundant IO operations occur, which increases client access latency and reduces throughput. To improve the hit rate of the Ceph Cache Tier cache pool, this paper proposes a temperature density-based cache replacement algorithm (TDC). The algorithm improves the hit rate of the cache pool by calculating the temperature density of the space consumed by each object and evicting objects with the lowest temperature density, thus evicting objects that contribute less to the hit rate. The algorithm mainly includes object temperature calculation, temperature density calculation and cache replacement policy. Subsequently, we evaluate the TDC algorithm on a real traces dataset using playback workload IO and demonstrate the efficiency of the algorithm in improving the cache hit rate. Finally, we applied the TDC algorithm to a Ceph distributed storage system and verified the performance of the Cache Tier based on the TDC algorithm.

关键词： Distributed Storage Hybrid Media caching algorithm Hierarchical Storage

来源：评论

学校读者我要写书评

暂无评论

caching scheme for information-centric networks with balanced content distribution

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2022年第7期35卷 e5104-e5104页

作者： Dutta, Nitul Patel, Shobhit K. Faragallah, Osama S. Baz, Mohammed Rashed, Ahmed Nabih Zaki SRM Univ Comp Sci & Engn Dept Guntur Andhra Pradesh India Marwadi Univ Elect & Commun Engn Dept Rajkot Gujarat India Taif Univ Dept Informat Technol Coll Comp & Informat Technol POB 11099 At Taif 21944 Saudi Arabia Taif Univ Dept Comp Engn Coll Comp & Informat Technol POB 11099 At Taif 21944 Saudi Arabia Menoufia Univ Elect & Elect Commun Engn Dept Fac Elect Engn Menoufia 32951 Egypt

Information-centric network (ICN) emphasizes on content retrieval without much bothering about the location of its actual producer. This novel networking paradigm makes content retrieval faster and less expensive by shifting data provisioning into content holder rather than content owner. caching is the feature of ICN that makes content serving possible from any intermediate device. An efficient caching is one of the primary requirements for effective deployment of ICN. In this paper, a caching approach with balanced content distribution among network devices is proposed. The selection of contents to be cached is determined through universal and computed using Zipf's law. The dynamic change in popularity of contents is also considered to take make caching decisions. For balancing the cached content across the network, every router keeps track of its neighbor's cache status. Three parameters, the proportionate distance of the router from the client (p(d)), the router congestion (r(c)), and the cache status (c(s)), are contemplated to select a router for caching contents. The new caching approach is evaluated in the simulated environment using ndnSIM-2.0. Three state-of-the-art approaches, Leave Copy Everywhere (LCE), centrality measures-based algorithm (CMBA), and a probability-based caching (probCache), are considered for comparison. The proposed method of caching shows the better performance compared to the other three protocols used in the comparison.

关键词： caching algorithm information-centric networks (ICNs) mathematical analysis popularity probabilistic caching

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：