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

caching algorithms for broadcasting and multicasting in disruption tolerant networks

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2016年第18期16卷 3377-3390页

作者： Tian, Feng Liu, Bo Zhou, Haibo Rui, Yun Chen, Jiacheng Xiong, Jian Gui, Lin Shanghai Jiao Tong Univ Dept Elect Engn Shanghai Peoples R China Deakin Univ Sch Informat Technol Melbourne Vic Australia Univ Waterloo Dept Elect & Comp Engn 200 Univ Ave West Waterloo ON N2L 3G1 Canada Chinese Acad Sci Shanghai Adv Res Inst Beijing Peoples R China

In delay and disruption tolerant networks, the contacts among nodes are intermittent. Because of the importance of data access, providing efficient data access is the ultimate aim of analyzing and exploiting disruption tolerant networks. caching is widely proved to be able to improve data access performance. In this paper, we consider caching schemes for broadcasting and multicasting to improve the performance of data access. First, we propose a caching algorithm for broadcasting, which selects the community central nodes as relays from both network structure perspective and social network perspective. Then, we accommodate the caching algorithm for multicasting by considering the data query pattern. Extensive trace-driven simulations are conducted to investigate the essential difference between the caching algorithms for broadcasting and multicasting and evaluate the performance of these algorithms. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： delay and disruption tolerant networks caching algorithm broadcasting multicasting

来源：评论

学校读者我要写书评

暂无评论

Integrated pre-fetching and replacing algorithm for graceful image caching

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2003年第9期E86B卷 2753-2763页

作者： Su, Z Washizawa, T Katto, J Yasuda, Y Waseda Univ Sch Sci & Engn Tokyo 1690072 Japan Canon Inc Canon Res Ctr Atsugi Kanagawa 2430193 Japan

The efficient distribution of stored information has become a major concern ill the Internet. Since the web workload characteristics show that more than 60% of network traffic is caused by image documents. how to efficiently distribute image documents from servers to end clients is an important issue. Proxy cache is an efficient solution to reduce network traffic. 2 And it has been shown that an image caching method (Graceful caching) based oil hierarchical coding format performs better than conventional caching schemes ill recent years. However, as the capacity of the Cache is limited, how to efficiently allocate the cache memory to achieve a minimum expected delay time is still a problem to he resolved. This paper presents all integrated caching algorithm to deal with the above problem for image databases. web browsers, proxies and other similar applications ill the Internet. By analyzing the web request distribution of the Graceful caching, both replacing and pre-fetching algorithms are proposed. We also show that our proposal can be carried out based oil information readily available ill the proxy server;it flexibly adapts its parameters to the hit rates and access pattern of users requesting documents in the Graceful caching. Finally we verify the performance of this algorithm by simulations.

关键词： graceful caching hierarchical image coding content delivery network web performance caching algorithm

来源：评论

学校读者我要写书评

暂无评论

A block-level caching optimization method for mobile transparent computing

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2018年第4期11卷 711-722页

作者： Tang, Yayuan Guo, Kehua Tian, Biao Cent South Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China Hunan Univ Sci & Engn Sch Elect & Informat Engn Yongzhou 425199 Peoples R China Minjiang Univ Key Lab Informat Proc & Intelligent Control Fujia Fuzhou 350108 Fujian Peoples R China

In mobile transparent computing, a large number of concurrent data requests from heterogeneous clients via the network need to be processed in a timely fashion, and servers have to repeatedly fetch (search and read) the data from storage, which may cause numerous I/O costs. Generally, disk access speed is more limited than memory;therefore, massive I/O operations at servers may become a bottleneck for the system, and transport delay of the total network caused by the limitation of wireless bandwidth and stability may lead to poorer user experience. Hence, caching method plays a significant role in performance improvement of transparent computing systems. In this paper, we propose a block-level caching optimization method for the server and client by analyzing the system bottleneck in mobile transparent computing. We first analyze the storage format of the data file and the three-layer structure in the server according to the characteristics of requesting data from the client to the server and propose a block-level cache based on the access time and access frequency for the server. Second, considering the restriction of bandwidth and stability of the wireless network, we analyze network boot processes from the client's startup and propose a client block-level cache optimization combined with local storage access technology. Finally, experimental results demonstrate that the server block-level cache optimization can effectively reduce the amount of server disk I/O, improving the concurrent ability of the server. In addition, the client block-level cache can significantly increase startup speed of the client, reduce network traffic and improve user experience.

关键词： I/O request Block-level cache caching algorithm Mobile transparent computing

来源：评论

学校读者我要写书评

暂无评论

Real-time carousel caching and monitoring in data broadcasting

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2006年第1期52卷 144-149页

作者： Park, DH Ku, TY Moon, KD Elect & Telecommun Res Inst Taejon 305606 South Korea

This paper proposes a DSM-CC carousel caching and management architecture that can support both priority-based scheduling of monitoring threads and caching of carousel objects for a quick launch and download of Xlet. The carousel objects are broadcast cyclically by the transmission policy. Lack of carousel object reception may cause performance deterioration. The data broadcasting middleware should guarantee real-time characteristics such as the processing time in periodic monitoring threads to detect a change in information without a long latency time. Therefore this proposed architecture can improve the predictability of periodic monitoring section filter threads by using the managing the thread pool and scheduling periodic threads. To guarantee fast launch of the data broadcasting application, this paper also proposes the cache control mechanism of DSM-CC data/object carousel. This proposed architecture can accommodate data broadcasting middleware that uses DSM-CC object carousel mechanisms, such as ACAP, OCAP and MHP.

关键词： DSM-CC object carousel data broadcasting 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

来源：评论

学校读者我要写书评

暂无评论

Fast media caching for geo-distributed data centers

引用

COMPUTER COMMUNICATIONS 2018年第May期120卷 46-57页

作者： Zhang, Wei Wen, Yonggang Liu, Fang Chen, Yiqiang Fan, Rui Nanyang Technol Univ Sch Comp Sci & Engn 50 Nanyang Ave Singapore 639798 Singapore Chinese Acad Sci Inst Comp Technol Beijing 100190 Peoples R China Shanghai Tech Univ Sch Informat Sci & Technol Shanghai 200031 Peoples R China

Recent years have witnessed a phenomenal increase in video traffic. Virtual content delivery networks (vCDNs) coordinate video content delivery through the use of computing and storage resources from the cloud and distributes content to edge nodes near consumers to reduce network traffic and improve service experience. An important objective of vCDNs is operation cost minimization. Since cloud data centers are geo-distributed, content transfer costs vary significantly with different data centers, i.e., the cost is high for retrieval from distant data centers and lower for nearby retrievals. Many popular caching algorithms in use today, such as LRU, do not consider cost when making caching decisions, and as a result, suffer from high data transfer costs and increased network congestion. On the other hand, cost-aware caching algorithms such as LANDLORD [1] are computationally inefficient, with time complexity scaling linearly to the amount of content in the vCDN. Such algorithms are unable to keep pace with the exponential growth in video content over time. In this paper, we propose FMC (fast media caching), a cost-aware and highly efficient caching algorithm for vCDN delivery over geo-distributed data centers. The load cost of each content item is determined by both the item's size and distance from the data center it is loaded from. We first prove that FMC is k/k-h+1 competitive under the resource augmentation paradigm, where FMC and the optimal offline adversary have k and h amount of cache, resp., and k >= h. Also, we show our algorithm is straightforward and efficient, requiring only O(log m) time per cache access, where m is the number of data centers and is a small constant in practice. We conduct experimental studies on MC using both synthetic and YouTube traces. Our results show that INC has on average 50% and up to 66.7% lower cost than tau. Besides, we show PMC is much faster than IANDLORD, and the speedup scales linearly with cache size.

关键词： CDN caching algorithm Cloud computing Geo-distributed data centers

来源：评论

学校读者我要写书评

暂无评论

On Resource Pooling and Separation for LRU caching

引用

PROCEEDINGS OF THE ACM ON MEASUREMENT AND ANALYSIS OF COMPUTING SYSTEMS 2018年第1期2卷 1–31页

作者： Tan, Jian Quan, Guocong Ji, Kaiyi Shroff, Ness Ohio State Univ 2015 Neil Ave Columbus OH 43210 USA

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, depending 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 for LRU caching 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. Technically, for a broad class of heavy-tailed distributions we derive the asymptotic miss probabilities of multiple flows of requests with varying data item sizes in a shared LRU cache space. It also validates the characteristic time approximation under certain conditions. These results provide new insights on improving the performance of caching systems.

关键词： caching algorithm LRU Miss probability Memcached

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

EdgeServe: Efficient Deep Learning Model caching at the Edge 19

EdgeServe: Efficient Deep Learning Model Caching at the Edge

引用

4th ACM/IEEE Symposium on Edge Computing (SEC)

作者： Guo, Tian Walls, Robert J. Ogde, Samuel S. Worcester Polytech Inst Worcester MA 01609 USA

ISBN: (纸本)9781450367332

In this work, we look at how to effectively manage and utilize deep learning models at each edge location, to provide performance guarantees to inference requests. We identify challenges to use these deep learning models at resource-constrained edge locations, and propose to adapt existing cache algorithms to effectively manage these deep learning models.

关键词： Deep Learning Inference caching algorithm Edge Computing Performance Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：