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

Performance improvement of distributed cache using middleware session

JOURNAL OF SUPERCOMPUTING 2024年第8期80卷 10818-10862页

作者： Jafari, Bita Bayat, Peyman Islamic Azad Univ Dept Comp Engn Rasht Branch Rasht Iran

This paper proposes a novel approach to routing architecture based on the Session-Cookie protocol. The proposed architecture performs service discovery by integrating IoTs geographic clustering technique and polymorphism mechanism. Prioritizing requests is done in cookies and the load balancing on sessions. The efficiency of the proxy server's distributed cache and service discovery is improved. Smart devices, vehicles, and people inaugurate a p2p connection to receive the service, exchange data, and share files in applications such as parking systems, navigation, and vehicle insurance companies. According to the results, the average response time and the bandwidth consumption have decreased, and the cache hit rate has reached 86%. Based on the principles of game theory, the proposed architecture in the extensive game model with imperfect information in the conditions ((mtcp, mudp), (Y, Y);lambda = 1, mu = 0)) has a weak sequential equilibrium and Nash equilibrium.

关键词： distributed cache Proxy server Cookie Game theory Fog computing

来源：评论

学校读者我要写书评

暂无评论

A distributed cache architecture with snooping for QoS routing in large networks

引用

COMPUTER NETWORKS 2004年第2期44卷 189-209页

作者： Rezvan, M Pawlikowski, K Sirisena, H Univ Canterbury Dept Comp Sci Christchurch 1 New Zealand Univ Canterbury Dept Elect & Elect Engn Christchurch 1 New Zealand

To meet the diverse quality-of-service (QoS) requirements of emerging multimedia applications, communication networks should provide end-to-end QoS guarantees. QoS routing is the first step towards this goal. The route computing overhead caused by on-demand calculation of QoS routes, especially in large networks with heavy traffic, is a concern and can cause scalability problems. This paper addresses this problem by introducing a novel distributed cache architecture. The distributed nature of the proposed cache architecture facilitates its deployment in large networks. To maximize the performance of the distributed cache architecture, cache snooping has been proposed to alleviate the side effects of network states fluctuations on the cached route so that the overall routing performance is significantly improved. Assuming a bandwidth-based QoS model, in performance evaluation of the proposed distributed cache architecture, we use a broad range of realistic network topologies, network traffic conditions, routing protocols, and aggregation techniques to evaluate different aspects of the proposed cache architecture under different conditions. The results confirm that the route caching is quite effective in reduction of route computing overhead. In addition, our results suggest that the cache snooping can significantly increase the overall routing performance, especially in the presence of highly inaccurate network state information. (C) 2003 Elsevier B.V. All rights reserved.

关键词： quality-of-service routing distributed cache cache snooping

来源：评论

学校读者我要写书评

暂无评论

HDcache: A distributed cache System for Real-Time Cloud Services

引用

JOURNAL OF GRID COMPUTING 2016年第3期14卷 407-428页

作者： Zhang, Jing Li, Qianmu Zhou, Wei Nanjing Univ Sci & Technol Sch Comp Sci & Engn Dept Software Engn 200 Xiaolingwei St Nanjing 210094 Jiangsu Peoples R China Yunnan Univ Natl Pilot Sch Software Kunming Yunnan Peoples R China

Providing a real-time cloud service requires simultaneously retrieving a large amount of data. How to improve the performance of file access becomes a great challenge. This paper first addresses the preconditions of dealing with this problem considering the requirements of applications, hardware, software, and network environments in the cloud. Then, a novel distributed layered cache system named HDcache is proposed. HDCahe is built on the top of Hadoop distributed File System (HDFS). Applications can integrate the client library of HDcache to access the multiple cache services. The cache services are built up with three access layers an in-memory cache, a snapshot of the local disk, and a network disk provided by HDFS. The files loaded from HDFS are cached in a shared memory which can be directly accessed by the client library. In order to improve robustness and alleviate workload, the cache services are organized in a peer-to-peer style using a distributed hash table and every cached file has three replicas scattered in different cache service nodes. Experimental results show that HDcache can store files with a wide range in their sizes and has the access performance in a millisecond level under highly concurrent environments. The tested hit ratio obtained from a real-world cloud serviced is higher than 95 %.

关键词： distributed cache Cloud storage Real-time file access In-memory system HDFS

来源：评论

学校读者我要写书评

暂无评论

Joint distributed cache and Power Control in Haptic Communications: A Potential Game Approach

引用

IEEE INTERNET OF THINGS JOURNAL 2021年第18期8卷 14418-14430页

作者： Fang, Tao Wu, Dan Chen, Jiaxin Yue, Chao Wang, Meng Army Engn Univ PLA Coll Commun Engn Nanjing 210000 Peoples R China Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing 211106 Peoples R China

Since haptic communications have an extreme requirement for the latency performance, the overdue content delivery will decrease the application experience. In order to reduce the transmission delay, we try to construct a cache-enabled D2D-assisted content-sharing framework, where the neighboring helpers preset contents and adjust their transmission power to timely serve more requesters. In particular, we modify the existing definition of the "closest" friend and take the social relationship into account to measure the overall influence caused by available neighboring helpers. However, such cooperation consumes the storage space and energy of the helpers, and accordingly, we introduce blockchain technology to propose an effective incentive mechanism where the helpers act as consensus users of blockchain and obtain the reward, i.e., the allocated computing power by the base station (BS), by contributing their local resources. Guided by this, the benefit of each helper is defined as a tradeoff of the reward and overheads. Meanwhile, we formulate the multiuser content delivery problem with the goal of maximizing the global benefits as the multiuser content delivery game. Then, we prove that the proposed game is an exact potential game (EPG) with at least one pure-strategy Nash equilibrium (NE). Meanwhile, the context-aware content delivery-based concurrent better reply (CCDCBR) algorithm is proposed to achieve a desirable solution. Finally, simulation results verify the validity of the proposed game model as well as the proposed algorithm.

关键词： Haptic interfaces Blockchain Games Delays Power control Device-to-device communication Tactile Internet Blockchain distributed cache haptic communications potential game power control

来源：评论

学校读者我要写书评

暂无评论

RDMM: Runtime dynamic migration mechanism of distributed cache for reconfigurable array processor

引用

INTEGRATION-THE VLSI JOURNAL 2020年 72卷 82-91页

作者： Jiang, Lin Liu, Yang Shan, Rui Feng, Yani Zhang, Yuan Xie, Xiaoyan Xian Univ Sci & Technol Integrated Circuit Design Lab Xian 710054 Peoples R China Xian Univ Posts & Telecommun Sch Comp Xian 710121 Peoples R China Xian Univ Posts & Telecommun Sch Elect Engn Xian 710121 Peoples R China

Reconfigurable array processors have emerged as powerful solution to speed up computationally intensive applications. However, they may suffer from a data access bottleneck as the frequency of memory access rises. At present, the distributed cache design in the reconfigurable array processor has a large cache failure rate, and the frequent access to external memory leads to a long delay in memory access. To mitigate this problem, we present a Runtime Dynamically Migration Mechanism (RDMM) of distributed cache for reconfigurable array processor based on the feature of obvious locality and high parallelism in accessing data. This mechanism allows temporary, static data to be dynamically scheduled to migrate data with a high access frequency from the remote cache to the processor's local migration storage table based on how often the reconfigurable array processors access the remote cache. We can accurately get the data on the shortest path by way of data search strategy based on migration storage tables, thereby effectively reducing the access delay of the entire system, increasing the memory bandwidth of the reconfigurable array processor. We leverage the hardware platform of reconfigurable array processor to test the proposed mechanism. The experimental results show that RDMM reduces access delay by up to 35.24% compared with the tradition distributed cache at the highest conflict rate. And compared with the Ref.[19], Ref.[20], Ref.[21] and Ref.[23], the working frequency can be increased by 15%, the hit rate can be increased by 6.1%, and the peak bandwidth can be increased by about 3x.

关键词： Reconfigurable array processor distributed cache Access frequency Runtime dynamic migration mechanism

来源：评论

学校读者我要写书评

暂无评论

Three levels of fail-safe mode in MPI I/O NVRAM distributed cache 7

Three levels of fail-safe mode in MPI I/O NVRAM distributed ...

引用

7th Annual International Young Scientists Conference on Computational Science (YSC)

作者： Malinowski, Artur Czarnul, Pawel Gdansk Univ Technol Fac Elect Telecommun & Informat Dept Comp Architecture Gdansk Poland

The paper presents architecture and design of three versions for fail-safe data storage in a distributed cache using NVRAM in cluster nodes. In the first one, cache consistency is assured through additional buffering write requests. The second one is based on additional write log managers running on different nodes. The third one benefits from synchronization with a Parallel File System (PFS) for saving data into a new file which allows to keep file history at the cost of space. We have shown that the three level fail-safe mode incorporating these versions does introduce minimal overhead for a random walk microbenchmark application for a 1GB file and checkpoints created every 2000 iterations, computing powers of a graph with 10000 vertices and up to 20% overhead for parallel processing of images up to 1000 megapixels compared to the basic NVRAM cache without fail-safe modes. We also presented times for checkpoint creation and restoring for sizes up to 10GBs. (C) 2018 The Authors. Published by Elsevier B.V.

关键词： NVRAM parallel MPI I/O extension fail safe distributed cache

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent System for distributed cache Maintenance 1

引用

15th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS)

作者： Venkata, Santhilata Kuppili Musial, Katarzyna Mahmoud, Samhar Keppens, Jeroen Kings Coll London Dept Informat London England Bournemouth Univ Fac Sci & Technol Poole Dorset England

ISBN: (数字)9783319599304

ISBN: (纸本)9783319599304;9783319599298

With the growing number of applications that require large data transfers from distributed databases, there is a great need for efficient distributed data caching methods. It is essential that data is cached at the best and optimal locations between users and data stores. cache management should consider patterns about data usage and make dynamic decisions to place data across cache units. In this paper, we have modelled the distributed data caching mechanism using multi-agent system allowing to test strategies and algorithms for data placement that later can be incorporated in the real life applications. Subsequently, we demonstrate the application of this system to study various distributed coordination strategies for identifying effective data placement and thus improving overall cache performance. This study is significant for distributed system applications.

关键词： distributed cache Agent based modelling Coordination strategies

来源：评论

学校读者我要写书评

暂无评论

Research on distributed cache mechanism in decision support system

Research on distributed cache mechanism in decision support ...

引用

International Conference on Systems, Computing Science and Software Engineering

作者： Liu Hui Ji Xiu-hua Shandong Econ Univ Comp Sci & Technol Dept Jinan 250014 Peoples R China

ISBN: (纸本)9781402062636

With the development of Internet technology, the business decision makers put forward higher requirements with the performance in Decision Support System (DSS). In order to improve the query response-time in DSS, this paper proposes a DSS architecture with distributed cache mechanism, gives the working flow of the system, and introduces an admission & replacement algorithm. Experiments prove that the system performance is favorable.

关键词： Decision Support System distributed cache on-line analytical processing data warehouse

来源：评论

学校读者我要写书评

暂无评论

A Research on cache Management for the distributed cache in P2P-CDN

A Research on Cache Management for the Distributed Cache in ...

引用

Conference on Electronic Commerce, Web Application and Communication

作者： Zhu, Binjie Shen, Zhiwei Beijing Univ Posts & Telecommun Sch Comp Sci & Technol Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Sch Econ & Management Beijing 100876 Peoples R China China Unicom Res Inst Beijing 100032 Peoples R China

ISBN: (纸本)9783642286575;9783642286582

distributed cache is a key technology in content distribution network, how to management the content in the distributed cache is an important issue. This paper presents a pull method for the distributed cache group in P2P-CDN. This method improves the utilization and cache hit rate for the cache group form optimize the content deployment in the group. The analysis shows that cache space can be use effectively to improve the group hit rate and reduce the average access delay.

关键词： cache Management distributed cache P2P CDN

来源：评论

学校读者我要写书评

暂无评论

Demonstration: Multi-agent System for distributed cache Maintenance 1

引用

15th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS)

作者： Venkata, Santhilata Kuppili Musial, Katarzyna Mahmoud, Samhar Keppens, Jeroen Kings Coll London Dept Informat London England Bournemouth Univ Fac Sci & Technol Poole Dorset England

ISBN: (数字)9783319599304

ISBN: (纸本)9783319599304;9783319599298

Innovations in science and technology is increasing the demand on huge data transfers and hence number of data caches. In this paper, we consider the community caching solution, Commcache, where many groups of users are working together on related projects distributed all over the world. We demonstrate the use of proactive caches for data placement problem with the help of multi-agent coordination.

关键词： distributed cache Agent based modelling Coordination strategies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：