Coded caching is an effective technique to reduce the redundant traffic in wireless networks. The existing coded caching schemes require the splitting of files into a possibly large number of subfiles, i.e., they perform coded subfile caching. Keeping the files intact during the caching process would actually be appealing, broadly speaking because of its simpler implementation. However, little ...

The amount of traffic in wireless networks is increasing exponentially, and this problem can be mitigated using device-to-device (D2D) caching technology, which installs a cache on mobile end device. Devices reduce the cell load through self-offloading via content their own D2D offloading others' caches. However, especially early stage systems, limited number devices with small storage might us...

Database caching accelerates access to frequently requested data of a remote database (backend) by keeping subsets of records close to applications. Thereby, the constraint-based approach primarily uses constraints to determine what predicate extensions are complete and which queries can be answered. Equipping the backend with so-called complete knowledge about the caches’ configurations enable...

Most existing studies on Web document caching consider Web proxies. The focus of this paper is caching in primary Web servers. This type of caching decreases request response time and server load. We use log les from four Web servers to analyze the performance of various proposed cache policies for Web servers: LRU-Threshold, LFU, LRU-SIZE, LRU-MIN, and the Pitkow/Recker policy. We also study a...

1 To reduce user-perceived latency in retrieving documents on the world wide web, a commonly used technique is caching both at the client's browser and more gainfully (due to sharing) at a proxy. The eeec-tiveness of Web caching hinges on the replacement policy that determines the relative value of caching diierent objects. An important component of such policy is to predict next-request times....

Most caching schemes in wide-area, distributed systems are client-initiated. Decisions of when and where to cache information are made without the beneet of the server's global knowledge of the usage patterns. In this paper, we present a new caching strategy: geographical push-caching. Using the server's global knowledge and a derived network topology, we distribute data to cooperating servers....

In-network caching is an important feature of Information Centric Networking (ICN). All routers in ICN will maintain caching ability, and, for each request, contents are cached at routers along the delivery path. This kind of on-path caching can reduce overall retrieval time. However, the same contents may end up to be cached all over the network causing wastes of caching space and decrease con...

The efficient distribution of stored information has become a major concern in the Internet. Since the web workload characteristics shows 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. And it has been shown that an ...

In this paper, we propose a novel client-side,multi-granularity caching scheme, called “Complementary Space Caching” (CS caching), for location-based services in mobile environments. Different from conventional data caching schemes that only cache a portion of dataset, CS caching maintains a global view of the whole dataset. Different portions of this view are cached in varied granularity based...

I will begin by explaining an optimal tableau-based algorithm for checking ALC-satisfiability which uses “global caching” and which appears to work well in practice. The algorithm settles a conjecture that “global caching can lead to optimality”. I will then explain how “global caching” can be extended to “global state caching” for inverse roles, thereby extending the result to ALCI-satisfiabil...