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

14th Web Information Systems and Applications Conference (WISA)

作者： Yang, Dongju Kai, Feng North China Univ Technol Res Ctr Cloud Comp Beijing Key Lab Integrat & Anal Large Scale Strea Beijing Peoples R China

ISBN: (纸本)9781538648063

It is one of the popular and effective way to build a unified authentication center to implement single sign-on among many applications in the enterprise. How to deal with the high concurrent and high flow of user requests to ensure the stability and efficiency of the authentication service is most important when integrating multiple systems. Aiming at the problem of authentication center, such as overloaded, single point of failure, slow response time, etc. we put forward a distributed architecture with cache to enable the unified authentication. The authentication tickets can be shared among multiple nodes by cache. The hot and important data can be prefetched to cache to improve the response time. A multi-factor cache replacement algorithm based on Hybird is also proposed which combining complex and diverse user behavior to improve the effectiveness of data replacement. The experimental results show that the optimized distributed authentication architecture can guarantee the stability of the system, and the cache mechanism can improve the response time, and a multi factor cache replacement algorithm based on Hybird can improve the cache hit ratio.

关键词： application integration identity authentication high availability cache mechanism cache replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

On the Theory and Potential of LRU-MRU Collaborative cache Management 11

On the Theory and Potential of LRU-MRU Collaborative Cache M...

引用

International Symposium on Memory Management (ISMM 11)

作者： Gu, Xiaoming Ding, Chen Univ Rochester Dept Comp Sci Rochester NY 14627 USA

ISBN: (纸本)9781450302630

The goal of cache management is to maximize data reuse. Collaborative caching provides an interface for software to communicate access information to hardware. In theory, it can obtain optimal cache performance. In this paper, we study a collaborative caching system that allows a program to choose different caching methods for its data. As an interface, it may be used in arbitrary ways, sometimes optimal but probably suboptimal most times and even counter productive. We develop a theoretical foundation for collaborative caches to show the inclusion principle and the existence of a distance metric we call LRU-MRU stack distance. The new stack distance is important for program analysis and transformation to target a hierarchical collaborative cache system rather than a single cache configuration. We use 10 benchmark programs to show that optimal caching may reduce the average miss ratio by 24%, and a simple feedback-driven compilation technique can utilize collaborative cache to realize 50% of the optimal improvement.

关键词： algorithms Measurement Performance collaborative caching bipartite cache cache replacement algorithm LRU MRU OPT

来源：评论

学校读者我要写书评

暂无评论

TOW:A Novel Time and Popularity Sensitive cache algorithm for P2P Live Media Streaming

TOW:A Novel Time and Popularity Sensitive Cache Algorithm fo...

引用

3rd International Conference on Communications and Networking in China

作者： Hu, Maozhi Xu, Ke Xia, Shu-tao Ye, Mingjiang Tsinghua Univ Grad Sch Shenzhen Shenzhen 518057 Guangdong Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China

ISBN: (纸本)9781424423736

P2P applications are widely used and make tremendous traffic in today's network. With the increasing number of IPTV users, it is reasonable to foresee that P2P live media streaming media will account for a considerable proportion in future backbone traffic. Few works focus on the P2P live media streaming cache in the view of ISP and directly compare its performance with the P2P file delivery. The paper studies the various cache replacement algorithms and caching differences between P2P live media streaming and P2P file delivery, then proposes a novel "time sensitive" cache algorithm for P2P live media streaming called Time over Weight (TOW) and confirms its better performance than popular algorithm such as FIFO, LRU, LSB and LFU.

关键词： cache replacement algorithm P2P live streaming hit rate

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of High Efficiency Acquisition Mechanism for Broadcast Audio Material 16

Design and Implementation of High Efficiency Acquisition Mec...

引用

16th IEEE/ACIS International Conference on Computer and Information Science (ICIS)

作者： Ding, Jian Wang, Yongbin Wang, Shujuan Wang, Qi Commun Univ China Informat Engn Sch Beijing 100024 Peoples R China Minist Culture Key Lab Acoust Visual Technol & Intelligent Contr Beijing 100024 Peoples R China Beijing Key Lab Modern Entertainment Technol Beijing 100024 Peoples R China

ISBN: (纸本)9781509055074

In the process of making radio programs, Radio stations need to get a lot of audio material, which are usually stored on the FTP server. The traditional radio program production station will download each audio, and do not consider the server's and the local environment, using a single-threaded download, which results in poor user experience. This paper designs an efficient download mechanism, which establishes a local cache which uses the least frequently used algorithm (LFU) as the basic cache replacement algorithm. To avoid the cache pollution and improve the hit rate of cache, this paper improves LFU by adding a kind of aging mechanism and considering the time effects. While the cache misses the audio, the client will take multi-threaded download to get more server resources. Finally, the efficiency of this method is verified by experimental comparison.

关键词： broadcast audio material FTP cache replacement algorithm multi-thread

来源：评论

学校读者我要写书评

暂无评论

Survey of Location Prediction of Users for Mobile Service

Survey of Location Prediction of Users for Mobile Service

引用

Online International Conference on Green Engineering and Technologies (IC-GET)

作者： Narvekar, Meera Nayak, Snehal Prabhu, Gaurav Brahmbhatt, Nikul DJ Sanghvi Coll Engn Dept Comp Engn Mumbai Maharashtra India

ISBN: (纸本)9781509045563

Predicting the location of the user can be done in various ways and recent development in this field gives us different approach for the same. For example prediction of user location can be predicted using different approach. The prediction of future context based on the recorded past locations is often conceived as the ultimate challenge in exploiting the whole of context histories. Another way to predict user location is by adapting user movement location or mining mobility features of user to predict the next location.

关键词： Location-based Services HMM cache replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamically selecting distribution strategies for web documents according to access pattern

引用

International Conference on Embedded and Ubiquitous Computing

作者： Qu, WY Wu, D Li, KQ Shen, H Japan Adv Inst Sci & Technol Grad Sch Informat Sci Nomi Ishikawa 9231292 Japan Dalian Univ Technol Dept Comp Sci & Engn Dalian 116024 Peoples R China Dalian Maritime Univ Coll Comp Sci & Technol Dalian 116026 Peoples R China

ISBN: (纸本)3540308075

Web caching and replication are efficient techniques for reducing web traffic, user access latency, and server load. In this paper we present a group-based method for dynamically selecting distribution strategies for web documents according to access patterns. The documents axe divided into groups according to access patterns and the documents in each group are assigned to the same distribution strategy. Our group-based model combines performance metrics with the different weights assigned to each of them. We use both trace data and statistical data to simulate our methods. The experimental results show that our group-based method for document distribution strategy selection can improve several performance metrics, while keeping others almost the same.

关键词： Web caching and replication distribution strategy cache replacement algorithm simulation trace data autonomous system (AS)

来源：评论

学校读者我要写书评

暂无评论

Scalable cache Component in ICN Adaptable to Various Network Traffic Access Patterns

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2018年第1期E101B卷 35-48页

作者： Ooka, Atsushi Suyong, Eum Ata, Shingo Murata, Masayuki Osaka Univ Grad Sch Informat Sci & Technol Suita Osaka 5650871 Japan Osaka City Univ Grad Sch Engn Osaka 5588585 Japan

Information-centric networking (ICN) has received increasing attention from all over the world. The novel aspects of ICN (e.g., the combination of caching, multicasting, and aggregating requests) is based on names that act as addresses for content. The communication with name has the potential to cope with the growing and complicating Internet technology, for example, Internet of Things, cloud computing, and a smart society. To realize ICN, router hardware must implement an innovative cache replacement algorithm that offers performance far superior to a simple policy-based algorithm while still operating with feasible computational and memory overhead. However, most previous studies on cache replacement policies in ICN have proposed policies that are too blunt to achieve significant performance improvement, such as first-in first-out (popularly, FIFO) and random policies, or impractical policies in a resource-restricted environment, such as least recently used (LRU). Thus, we propose CLOCK-Pro Using Switching Hash-tables (CUSH) as the suitable policy for network caching. CUSH can identify and keep popular content worth caching in a network environment. CUSH also employs CLOCK and hash-tables, which are low-overhead data structure, to satisfy the cost requirement. We numerically evaluate our proposed approach, showing that our proposal can achieve cache hits against the traffic traces that simple conventional algorithms hardly cause any hits.

关键词： information-centric networking content-centric networking caching cache replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

CRP: Conditional replacement Policy for Reliability Enhancement of STT-MRAM caches

引用

IEEE TRANSACTIONS ON MAGNETICS 2022年第7期58卷

作者： Rahbari, Marjan Farbeh, Hamed Islamic Azad Univ South Tehran Branch Dept Comp Engn Tehran *** Iran Amirkabir Univ Technol Tehran Polytech Dept Comp Engn Tehran 158754413 Iran

Driven by the trends of emerging technologies in on-chip memories, with increasing the size of last-level caches (LLCs), spin-transfer torque magnetic random access memories (STT-MRAMs) are the most promising alternative technology among the non-volatile memories (NVMs) to replace SRAMs. Despite their high density, scalability, and near-zero leakage power, the reliability of STT-MRAM LLCs is threatened by a high error rate due to their stochastic switching behavior. The error rate is highly influenced by the cache management, which necessitates redesigning the cache replacement policy based on the error behavior. In this article, we propose an error-aware cache replacement policy, namely, conditional replacement policy (CRP), to improve the reliability of STT-MRAM caches by decreasing the rate of both read disturbance and write failure. This is ascertained by nominating an appropriate data block in the cache to be replaced with an incoming data block, considering the minimum error rate. Moreover, the performance and latency of both write and read operations are considered. The simulation results show that compared with the state-of-the-art replacement policy in STT-MRAM caches, CRP reduces the total error rate by 68%. In addition, the proposed policy enhances the performance by 2% and saves energy consumption by 19%, on average. Meanwhile, the total number of writes is decreased by 41% compared with the previous scheme.

关键词： Thermal stability Reliability Magnetic tunneling Error analysis Switches Thermal factors Random access memory cache replacement algorithm read disturbance spin-transfer torque magnetic random access memory (STT-MRAM) cache stochastic switching write failure

来源：评论

学校读者我要写书评

暂无评论

Quality-Adaptive Proxy Caching for Peer-to-Peer Video Streaming Using Multiple Description Coding

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2009年第3期25卷 687-701页

作者： Ding, Jen-Wen Lan, Shi-Yuan Natl Kaohsiung Univ Appl Sci Dept Informat Management Kaohsiung 807 Taiwan

In the past few years, video streaming has been one of the most prominent applications in the Internet. There are basically two types of approaches to deliver on-demand video streams: infrastructure-based and infrastructure-less. The infrastructure-based approach, also known as the content delivery network (CDN) approach. employs numerous replicate servers and proxies to assist video streaming. The main drawback of this approach is that it is costly to deploy numerous servers and proxies. The infrastructure-less approach, also known as the peer-to-peer (P2P) approach, employs numerous peers to relay video streams. The main drawback of the P2P approach is its instability due to frequent joining/leaving of peers. The state-of-the-art development is to combine the two types of approaches. In this paper, we employ multiple description coding (MDC) to develop a novel P2P-assisted proxy caching scheme, called MP3, for on-demand video streaming. Our simulation results show that with the use of MDC, MP3 call effectively provide adaptive video quality for clients in a heterogeneous network environment.

关键词： adaptive video streaming peer-to-peer computing multimedia proxy cache replacement algorithm multiple description coding

来源：评论

学校读者我要写书评

暂无评论

DESIGN AND IMPLEMENTATION OF A P2P COOPERATIVE PROXY cache SYSTEM

引用

Journal of Interconnection Networks 2007年第2期8卷 147-162页

作者： JAMES Z. WANG VIPUL BHULAWALA Department of Computer Science Clemson University Box 340974 Clemson SC 29634-0974 USA +1-864-656-7678.

In this paper, we design and implement a P2P cooperative proxy caching system based on a novel P2P cooperative proxy caching scheme. To effectively locate the cached web documents, a TTL-based routing protocol is proposed to manage the query and response messages in the P2P cooperative proxy cache system. Furthermore, we design a predict query-route algorithm to improve the TTL-based routing protocol by adding extra information in the query message packets. To select a suitable cache replacement algorithm for the P2P cooperative proxy cache system, three different cache replacement algorithms, LRU, LFU and SIZE, are evaluated using web trace based performance studies on the implemented P2P cooperative proxy cache system. The experimental results show that LRU is an overall better cache replacement algorithm for the P2P proxy cache system although SIZE based cache replacement approach produces slightly better cache hit ratio when cache size is very small. The performance studies also demonstrate that the proposed message routing protocols significantly improve the performance of the P2P cooperative proxy cache system, in terms of cache hit ratio, byte hit ratio, user request latency, and the number of query messages generated in the proxy cache system, compared to the flooding based message routing protocol.

关键词： P2P cooperative proxy caching cache replacement algorithm message routing protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：