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

web caching： A Way to Improve web QoS

Journal of Computer Science & Technology 2004年第2期19卷 113-127页

作者： Ming-KuanLiu Fei-YueWang DanielDajunZeng TheLabforComplexSystemsandIntelligentSciences InstituteofAutomationTheChineseAcademyofSciencesBeijing100080P.R.China SystemsandIndustrialEngineeringDepartment UniversityofArizonaTucsonAZ85721USA ManagementInformationSystemsDepartment UniversityofArizonaTucsonAZ85721USA

As the Internet and World Wide web grow at a fast pace, it is essential that the web's performance should keep up with increased demand and expectations. web caching technology has been widely accepted as one of the effective approaches to alleviating web traffic and increase the web Quality of Service (QoS). This paper provides an up-to-date survey of the rapidly expanding web caching literature. It discusses the state-of-the-art web caching schemes and techniques, with emphasis on the recent developments in web caching technology such as the differentiated web services, heterogeneous caching network structures, and dynamic content caching.

关键词： web traffic web caching web QoS differentiated service dynamic content caching

来源：评论

学校读者我要写书评

暂无评论

web caching and content distribution: a view from the interior

引用

COMPUTER COMMUNICATIONS 2001年第2期24卷 222-231页

作者： Gadde, S Chase, J Rabinovich, M Duke Univ Dept Comp Sci Durham NC 27708 USA AT&T Labs Res Florham Park NJ 07932 USA

Research in web caching has yielded analytical tools to model the behavior of large-scale web caches. Recently, Wolman et al. (Proceedings of the 17th ACM Symposium on Operating Systems Principles, December 1999) have proposed an analytical model and used it to evaluate the potential of cooperative web proxy caching for large populations. This paper shows how to apply the Wolman model to study the behavior of interior cache servers in multi-level caching systems. Focusing on interior caches gives a different perspective on the model's implications, and it allows three new uses of the model. First, we apply the model to large-scale caching systems in which the interior nodes belong to third-party content distribution services. Second, we explore the effectiveness of content distribution services as conventional web proxy caching becomes more prevalent. Finally, we correlate the model's predictions of interior cache behavior with empirical observations from the root caches of the NLANR cache hierarchy. (C) 2001 Published by Elsevier Science B.V.

关键词： web caching content distribution interior cache servers

来源：评论

学校读者我要写书评

暂无评论

Probabilistic methods for web caching

引用

PERFORMANCE EVALUATION 2001年第2-3期46卷 125-137页

作者： Starobinski, D Tse, D Boston Univ Dept Elect & Comp Engn Boston MA 02215 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

We introduce and analyze new randomized policies for the management of web caches. The proposed policies are fully scalable, i.e., handling a hit or an eviction requires only O(1) time. Our analysis is probabilistic, in nature, and based on an extended version of the independent reference model. The extension is needed in order to deal with the varying-cost and -size features of web documents. Under this assumption, we derive closed-form expressions for the stationary probabilities of finding each possible arrangement of the documents within the cache. Our analysis shows that the performance of the proposed algorithms are close to that of the optimal off-line algorithm. Using simulations and real traces, we also show that the new algorithms perform at least as well as existing algorithms of higher complexity. Variations on the algorithms, aimed at increasing their responsiveness to non-stationary trends, are also investigated. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： web caching probabilistic method independent reference model

来源：评论

学校读者我要写书评

暂无评论

web log data warehousing and mining for intelligent web caching

引用

DATA & KNOWLEDGE ENGINEERING 2001年第2期39卷 165-189页

作者： Bonchi, F Giannotti, F Gozzi, C Manco, G Nanni, M Pedreschi, D Renso, C Ruggieri, S Univ Pisa Dipartimento Informat I-56125 Pisa Italy Univ Pisa Dipartimento Informat I-56125 Pisa Italy

We introduce intelligent web caching algorithms that employ predictive models of web requests;the general idea is to extend the least recently used (LRU) policy of web and proxy, servers by making it sensitive to web access models extracted from web log data using data mining techniques. Two approaches have been studied in particular, frequent patterns and decision trees. The experimental results of the new algorithms show substantial improvement over existing LRU-based caching techniques, in terms of hit rate. We designed and developed a prototypical system, which supports data warehousing of web log data, extraction of data mining models and simulation of the web caching algorithms. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： web caching log data warehousing data mining frequent patterns association rules decision trees

来源：评论

学校读者我要写书评

暂无评论

Coordinated en-route web caching

引用

IEEE TRANSACTIONS ON COMPUTERS 2002年第6期51卷 595-607页

作者： Tang, XY Chanson, ST Hong Kong Univ Sci & Technol Dept Comp Sci Hong Kong Hong Kong Peoples R China

web caching is an important technique for reducing Internet access latency, network traffic, and server load. This paper investigates cache management strategies for the en-route web caching environment, where caches are associated with routing nodes in the network. We propose a novel caching scheme that integrates both object placement and replacement policies and which makes caching decisions on all candidate sites in a coordinated fashion. In our scheme, cache status information along the routing path of a request is used in dynamically determining where to cache the requested object and what to replace if there is not enough space, The object placement problem is formulated as an optimization problem and the optimal locations to cache the object are obtained using a low-cost dynamic programming algorithm. Extensive simulation experiments have been performed to evaluate the proposed scheme in terms of a wide range of performance metrics. The results show that the proposed scheme significantly outperforms existing algorithms which consider either object placement or replacement at individual caches only.

关键词： web caching web cache management web object placement transparent web cache dynamic programming performance evaluation World Wide web

来源：评论

学校读者我要写书评

暂无评论

Adaptive web caching: towards a new global caching architecture

引用

COMPUTER NETWORKS AND ISDN SYSTEMS 1998年第22-23期30卷 2169-2177页

作者： Michel, S Nguyen, K Rosenstein, A Zhang, LX Floyd, S Jacobson, V Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90095 USA Lawrence Berkeley Natl Labs Berkeley CA USA

An adaptive, highly scalable, and robust web caching system is needed to effectively handle the exponential growth and extreme dynamic environment of the World Wide web. Our work presented last year sketched out the basic design of such a system. This sequel paper reports our progress over the past year. To assist caches making web query forwarding decisions, we sketch out the basic design of a URL routing framework. To assist fast searching within each cache group, we let neighbor caches share content information. Equipped with the URL routing table and neighbor cache contents, a cache in the revised design can now search the local group, and forward all missing queries quickly and efficiently, thus eliminating both the waiting delay and the overhead associated with multicast queries. The paper also presents a proposal for incremental deployment that provides a smooth transition from the currently deployed cache infrastructure to the new design. (C) 1998 Published by Elsevier Science B.V. All rights reserved.

关键词： web caching self-organizing multicast

来源：评论

学校读者我要写书评

暂无评论

INTELLIGENT web caching USING MACHINE LEARNING METHODS

引用

NEURAL NETWORK WORLD 2011年第5期21卷 429-452页

作者： Sulaiman, Sarina Shamsuddin, Siti Mariyam Abraham, Ajith Sulaiman, Shahida Univ Teknol Malaysia Fac Comp Sci & Informat Syst Skudai 81310 Johor Malaysia VSB Tech Univ Ostrava Fac Elect Engn & Comp Sci Ostrava Czech Republic

web caching is a technology to improve network traffic on the Internet. It is a temporary storage of web objects for later retrieval. Three significant advantages of web caching include reduction in bandwidth consumption, server load, and latency. These advantages make the web to be less expensive yet it provides better performance. This research aims to introduce an advanced machine learning method for a classification problem in web caching that requires a decision to cache or not to cache web objects in a proxy cache server. The challenges in this classification problem include the issues in identifying attributes ranking and improve the classification accuracy significantly. This research includes four methods that are Classification and Regression Trees (CART), Multivariate Adaptive Regression Splines (MARS), Random Forest (RF) and Tree Net (TN) for classification on web caching. The experimental results reveal that CART performed extremely well in classifying web objects from the existing log data with a size of web objects as a significant attribute for web cache performance enhancement.

关键词： Classification of web objects web caching machine learning methods

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of peer-to-peer web caching systems

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2006年第5期79卷 714-726页

作者： Shi, Weisong Mao, Yonggen Wayne State Univ Dept Comp Sci Mobile & Internet Syst Grp Detroit MI 48202 USA

Peer-to-peer web caching has attracted a great attention from the research community recently, and is one of the potential peer-to-peer applications. In this paper, we systematically examine the three orthogonal dimensions to design a peer-to-peer web caching system, including the caching algorithm, the document lookup algorithm, and the peer granularity. In addition to the traditional URL-based caching algorithm, we also evaluate the content-based caching algorithm for both dynamic and static web content. Four different document lookup algorithms are compared and evaluated in the context of four different peer granularities, i.e., host level, organization level, building level, and centralized. A detailed simulation, using the traces collected at a medium size education institution, is conducted for the purpose of performance evaluation. Finally, several implications derived from this analysis are also discussed. (c) 2005 Elsevier Inc. All rights reserved.

关键词： peer-to-peer systems web caching analysis model latency reduction hit ratio performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Combining request scheduling with web caching

引用

THEORETICAL COMPUTER SCIENCE 2004年第2-3期324卷 201-218页

作者： Feder, T Motwani, R Panigrahy, R Seiden, S van Stee, R Zhu, A Stanford Univ Palo Alto CA 94301 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA Cisco Syst San Jose CA 95134 USA Ctr Math & Comp Sci NL-1090 GB Amsterdam Netherlands

We extend the classic paging model by allowing reordering of requests under the constraint that a request is delayed by no longer than a predetermined number of time steps. We first give a dynamic programming algorithm to solve the offline case. Then we give tight bounds on competitive ratios for the online case. For caches of size k, we obtain bounds of k + O(1) for deterministic algorithms and Theta(log k) for randomized algorithms. We also give bounds for the case where either the online or the offline algorithm can reorder the requests, but not both. Finally, we extend our analysis to the case where pages have different sizes. (C) 2004 Published by Elsevier B.V.

关键词： paging web caching request reordering

来源：评论

学校读者我要写书评

暂无评论

The effect of web caching on network planning

引用

COMPUTER COMMUNICATIONS 1999年第14期22卷 1343-1350页

作者： Sun, H Zang, X Trivedi, KS Duke Univ Dept Elect & Comp Engn Ctr Adv Comp & Commun Durham NC 27708 USA

In this paper, the effect of web caching on network planning, in the sense of bandwidth computation for the access link interconnecting the ISP's subnet with the Internet, is studied by means of simulations. The latency of a browser retrieving files is studied for given traffic characteristics, number of users, bandwidth of access link, and cache hit rate. From our analysis, we find that using a well-designed web cache with a 50% hit rate is more effective than doubling the bandwidth for an ISP's access link to the Internet, with respect to decreasing retrieval latency. In other words, we can reduce half of the bandwidth of the access Link by using web caching without compromising retrieval latency. The results are very encouraging and useful to the ISPs, enterprises and universities that are planning to interconnect their Intranets with the Internet. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： web caching network planning Pareto distibution Weibull distribution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：