Web Caching Research Articles

Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks

Motivated by emerging resource allocation and data placement problems such as web caches and peer-to-peer systems, we consider and study a class of resource allocation problems over a network of ag...

Performance optimization of agricultural products website front-end based on user experience

With the rapid development of Internet technology, users have higher and higher requirements for the response speed of the website, which makes the performance optimization of the website become extremely important. How to solve this problem is the key to improving the user experience. In this paper, taking the characteristic agricultural product website as an example, we analyze the website front-end performance optimization in CSS optimization, page rendering, HTTP request reduction, Ajax caching and web caching, and offer the corresponding performance optimization methods.

An SGX-Based Key Management Framework for Data Centric Networking

As the Internet has evolved from host-to-host communications to content distribution, data-centric networking is poised to improve networking efficiency. Especially, as the cloud computing, the Internet of Things (IoT), the fifth-generation (5G) networking become popular, there is a consensus that data is to be distributed over some potentially untrusted middleboxes (e.g., CDN servers, web caches) that mediates between data writers and data readers. While data-centric networking designs such as Edge Caching, Global Data Plane (GDP), Named Data Networking (NDN) have been active explored, there have been few studies on how to distribute and manage keys for data access control in such designs with untrusted servers (i.e., middleboxes). We present a key management framework in which symmetric and asymmetric keys are securely managed. A writer publishes his (encrypted) data along with the decryption key for the data. Likewise, an authorized reader retrieves the decryption key as well as the data of interest. To make the key distribution securely between a writer and a reader via an untrusted server, we introduce a key server running on top of the Intel SGX technology. In this way, we can manage and distribute keys for data access control in an efficient and flexible manner. We evaluate the proposed framework by prototyping, which shows some delays in key publishing and retrieval. However, the delays in real operations will be marginal as the period will become longer.

Improving of cache memory performance based on a fuzzy clustering based page replacement algorithm by using four features

Internet is one of the most influential new communication technologies has influenced all aspects of human life. Extensive use of the Internet and the rapid growth of network services have increased network traffic and ultimately a slowdown in internet speeds around the world. Such traffic causes reduced network bandwidth, server response latency, and increased access time to web documents. Cache memory is used to improve CPU performance and reduce response time. Due to the cost and limited size of cache compared to other devices that store information, an alternative policy is used to select and extract a page to make space for new pages when the cache is filled. Many algorithms have been introduced which performance depends on a high-speed web cache, but it is not well optimized. The general feature of most of them is that they are developed from the famous LRU and LFU designs and take advantage of both designs. In this research, a page replacement algorithm called FCPRA (Fuzzy Clustering based Page Replacement Algorithm) is presented, which is based on four features. When the cache space can’t respond to a request for a new page, it selects a page of the lowest priority cluster and the largest login order; then, removes it from the cache memory. The results show that FCPRA has a better hit rate with different data sets and can improve the cache memory performance compared to other algorithms.

A page replacement algorithm based on a fuzzy approach to improve cache memory performance

The memory management in the operating system includes a part called the page replacement algorithms. Replacement algorithms in environments that require high-performance computing are considered as an important issue. For example, these algorithms are very important in cache management in microprocessors, web caching, replication strategies in distributed information systems and so on. Due to the important role of replacement algorithms in overcoming the problem of performance caused by the difference in processor speeds and memory, many algorithms were proposed. Most of them are the developed schemes of the least frequently used (LFU) and least recently used (LRU). Although most proposed designs can solve the LRU and LFU defects, they are implemented in a difficult way. The most important advantage of LRU and LFU is their simple implementation. This research proposes a page replacement algorithm that is simple to implement. The algorithm, which uses three parameters to cluster cache pages, is called the fuzzy page replacement algorithm. Whenever a miss occurs, it selects a page of the cluster with the lowest priority which has the smallest Euclidean distance with its center and then exits the cache. The most significant advantage of the algorithm is using the FCM (fuzzy c-means) algorithm to cluster pages, resulting in better replacement and hence higher memory performance.

Threshold based partial partitioning fuzzy means clustering algorithm (TPPFMCA) for pattern discovery

Fuzzy C-means is very popular data clustering algorithm use in many systems modeling to determine system behavior in concise way. However, it requires the specifications of numbers of clusters in advance, which is not feasible in many system modeling. Prediction Models, based on web caching and prefetching, are such modeling systems in which to predict numbers of clusters in advance is quite impossible so Fuzzy C-means algorithm is in original way is not suit to such modeling. In this paper, new clustering algorithm is proposed which is fusion of Fuzzy Means and threshold concepts. The paper exhibits experiments of the proposed algorithm in context to web caching and prefetching model. The paper also compares the result of this algorithm with familiar Markov Model.

Accelerating the Internet in the presence of Big Data: Reducing user delays by leveraging historical user request patterns for web caching

Approximately 4 billion people have access to the Internet, additionally 23 billion devices are connected as of 2018. This has allowed for a substantial growth in data collection which has allowed for Big Data to flourish. The continued increase in user, devices, and Big Data usage has created a significant intensification in Internet traffic. This in turn has the potential to increase user delays when accessing data on the Internet. There are a number of ways to help reduce user latency, web caching is able to reduce web user delays in addition to reducing network traffic and the load on web servers. In this study we propose a proxy level web caching mechanism leveraging historical web patterns to help reduce user latency and accelerate the Internet. In addition we survey the state of the art of other caching approaches. Our investigation shows that using historical patterns as part of a proxy caching mechanisms in large scale networks can significantly shorten the latency for users in this era of Big Data

The Open High Throughput Computing Content Delivery Network

LHC experiments make extensive use of web proxy caches, especially for software distribution via the CernVM File System and for conditions data via the Frontier Distributed Database Caching system. Since many jobs read the same data, cache hit rates are high and hence most of the traffic flows efficiently over Local Area Networks. However, it is not always possible to have local web caches, particularly for opportunistic cases where experiments have little control over site services. The Open High Throughput Computing (HTC) Content Delivery Network (CDN), openhtc.io, aims to address this by using web proxy caches from a commercial CDN provider. Cloudflare provides a simple interface for registering DNS aliases of any web server and does reverse proxy web caching on those aliases. The openhtc.io domain is hosted on Cloudflare's free tier CDN which has no bandwidth limit and makes use of data centers throughout the world, so the average performance for clients is much improved compared to reading from CERN or a Tier 1. The load on WLCG servers is also significantly reduced. WLCG Web Proxy Auto Discovery is used to select local web caches when they are available and otherwise select openhtc.io caching. This paper describes the Open HTC CDN in detail and provides initial results from its use for LHC@Home and USCMS opportunistic computing.

PCR: caching replacement algorithm in proxy server

The efficiency of caching is a key factor affecting the performance of content delivery network (CDN). The main aim of current CDN caching is to obtain a higher hit ratio, since the validation and freshness of outdated pages have not received due consideration in their replacement model. In this paper, a new improved cache profit model is clearly defined, and the freshness factors of web pages have been taken into adequate account. Based on the profit model, a new replacement algorithm – proxy cache replacement (PCR) – is recommended, and it can be proved optimal under the rational hypothesis. To conclude, a series of comparative experiments verified the efficiency of PCR in web caching replacement.

C3C: A New Static Content-Based Three-Level Web Cache

One way of improving the performance of a search engine is increasing the hit ratio of the search engine cache. A common and widely used approach for increasing the hit ratio is a combination of the result cache, the posting list cache, and the intersection cache, yielding a three-level cache architecture. However, the existing multi-level cache architectures do not consider the dependencies among the content cached in different parts. Thus, the same content might be stored multiple times in the architectures, resulting in duplicate hits. In other words, a large amount of space in the cache is wasted. In this paper, we propose a new static content-based three-level cache architecture that adopts a new content-based three-level Web cache filling algorithm that takes into account the dependencies among the content cached in different parts. In the proposed cache architecture, duplicate hits are reduced and the hit ratio increases. Extensive experiments were conducted on a real data set. The results have shown a significant improvement on the hit ratios compared with two existing approaches.

User-oriented cache deletion algorithm in a delayed update-tolerant web cache server for supporting a non-formal education

In developing countries, it is often difficult to use web content for e-learning because Internet accessing is unavailable or limited. To support education in such a situation, the authors previously proposed a system that uses a delayed update-tolerant web cache server and a wireless LAN. This system stores e-learning webpages requested by free school children in a cache memory, which is then carried to the free school so that the children can access the webpages in an off-line environment. The present paper proposes a cache deletion algorithm that reflects children’s requests for content retention in the cache server. It is called a user-oriented least recently used (LRU) algorithm. We have developed an experimental system that implemented this algorithm and carried out a learning experiment under conditions that simulated actual usage. We compared the proposed algorithm with existing cache deletion algorithms, including the least recently used (LRU), the least frequently used (LFU) and the least frequently recently used (LFRU) algorithms, in terms of the frequently accessed leaning cache retention rate.

ANALYSIS END USER BEHAVIOR OVER WEB SCENARIO FOR EFFICIENT PREFETCHING THROUGH BIG DATA ANALYSIS

Web caching and restoration are the most common techniques that play a key role in improving web performance by keeping web objects that are likely to be visited in the near future closer to the custo mer. Web caching can work independently or in combination with Web pre-fetching. Cache and Web fetching can complement each other as the temporary Log file is a crucial part of web application. The log analysis is an important issue for the web application. Log file is not to be over emphasized as a source of information in systems and network management, whereas conduct efficient investigation and gathering of useful information need to correlate different log file. Task of analyzing event log files with the ever-increasing size and complexity of today's event logs has become cumbersome to carry out manually. Nowadays latest spotlight is automatic analysis of these logs files. Analysis of Web log is an innovative and unique domain constantly formed and modified by the convergence of several emerging web technologies. Because of its interdisciplinary nature, the diversity of issues addressed, the variety and the number of Web applications, is subject to many different methodologies. Proposed methodology has been used as effective web pre-fetching technique for frequent page generation by using relative position by inter session gap. The fast and efficient web pre-fetching scheme has improved user response of web page and expedites users visiting speed. Keywords: Web mining, web caching, web prefetching, Clustering, Client server Architecture, Log File.

PENERAPAN TEKNOLOGI CACHE SERVER BERBASIS IoT DENGAN RASPBERRY Pi3 MENGGUNAKAN METODE FORWARD CHAINNING

With the rapid technological development, the growing number of Internet clients over time, the internet access response is slow and it takes filtering of a few websites that can harm users. For that required cache proxy server to speed up internet access time and website filtering. The use of proxy servers usually still use the standard configuration on the proxy server. This configuration can be set or modified (tuning) in such a way as to create a proxy server that is reliable and have better performance. The play on the proxy server is done by changing some parameters that are inside the proxy server application and adapted to the needs of usage on the internet network. The application used to create this proxy server is squid that runs on raspberry pi3 with a rasbian operating system. Squid applications are mostly used in local and internet networks for storing web cache, blocking multiple websites, managing bandwidth up to access restrictions.

Web cache intelligent replacement strategy combined with GDSF and SVM network re-accessed probability prediction

Web caching is used to solve the problem of network access delays and network congestion. The intelligent cache replacement strategy directly affects the cache hit rate. This paper proposed a web cache replacement strategy combining greedy dual size frequency (GDSF) algorithm and support vector machine (SVM) re-accessed probability prediction. In the traditional GDSF method, a new objective function is constructed by considering the network object type and object re-accessed probability. The object re-accessed probability is predicted by learning the historical access data through SVM classifier. The simulation results show that compared with the traditional LRU and GDSF schemes, the proposed strategy has a higher request hit rate and byte hit ratio. When the cache size is 16%, the HR and BHR values reached 0.623 and 0.522, respectively.

A Web cache replacement strategy for spacecraft comprehensive testing system

A Web cache replacement strategy for spacecraft comprehensive testing system

Improved Integrated Approach of Web Prefetching and Caching using eLRU

Improved Integrated Approach of Web Prefetching and Caching using eLRU

BANDWIDTH SHAPING MENGGUNAKAN PROXY SQUID

The development of technology is very fast. Nowadays, technology has influenced human life. For most people, handphone and computer now become a necessity. Computer can give information as we need with internet, but internet can cause a negative influence as well. In this research, we build an web base application which can block a negative-influence sites using Squid Proxy. Squid is a daemon that used as a proxy server and web cache. It can work as a connection sharing, filtering and caching. The web which domain block is successfully built which can create a bandwidth share and domain block web base application.

Information Intelligent Management System Based on Hadoop

In order to explore the information management, the cloud computing technology is applied to the field of geographic information system, and remote sensing data storage and management system based on Hadoop is studied and realized. The main function of this system includes that the remote sensing data storage module provides the remote sensing data download function for data administrator, supports HTTP protocol and FTP protocol multi-threaded distributed HTTP download. The parallel constructing algorithm of remote sensing image of Pyramid based on Map Reduce is realized by the module, and layered cutting and block storage of massive remote sensing data are carried out. The GDAL open source library suitable for fast read raster data is used and it provides data resource for remote sensing data parallel cutting. In addition, the Geo Web Cache open source tile map service middleware is adopted and HBase is introduced as the storage support of tiles, which can deal with a large number of users’ visit, including loading and drag of maps. The system test is carried out to verify the effectiveness and practicability of the method proposed. The test results can show that the remote sensing data storage and management system based on Hadoop can effectively handle remote sensing data and improve the user’s experience. It is concluded that the information management system has high effectiveness and good practicability.

An Improved Web Cache Replacement Algorithm Based on Weighting and Cost

Cache memory plays an important role in improving the performance of web servers, especially for big data transmission, which response time is constrained. It is necessary to use an effective method, such as web cache. Because an outstanding cache replacement algorithm can not only reduce the users access time but also improve the performance of the system. The traditional used weighting replacement policy does not consider the size parameter, hence, it may perform poorly while the datasets are larger. In this paper, we propose a novel, high-performance cache replacement algorithm for the web cache, named weighting size and cost replacement policy (WSCRP) bases on the weighting replacement policy. The algorithm recalculates the objects weight with adding the cost attribute in the cache, then orders the weight. Additionally the influence of various factors on the Web object as frequency, time, and cost value are considered. When the cache space cannot satisfy the new request object, the replacement policy WSCRP replaces the largest weighting and cost object. The experiments show that proposed algorithm has higher hit rate and byte rate for different datasets, and can effectively improve the performance of web cache.

A Survey on Web Pre-Fetching and Web Caching Techniques for Latency Optimization in Mobile Environment

A Survey on Web Pre-Fetching and Web Caching Techniques for Latency Optimization in Mobile Environment