Results 191 to 200 of about 3,766 (244)

Caching Policies for In-Network Caching

2012 21st International Conference on Computer Communications and Networks (ICCCN), 2012
Recent works on Information Centric Networking enable the exploitation of the caching resources in the new generation of routers (Content Routers or CR). So far, only a basic Least Recently Used (LRU) strategy implemented on every CR has been proposed.
Li, Zhe, Simon, Gwendal, Gravey, Annie
openaire   +2 more sources

In-Network Cache Coherence

IEEE Computer Architecture Letters, 2006
We propose implementing cache coherence protocols within the network, demonstrating how an in-network implementation of the MSI directory-based protocol allows for in-transit optimizations of read and write delay. Our results show 15% and 24% savings on average in memory access latency for SPLASH-2 parallel benchmarks running on a 4times4 and a ...
Noel Eisley, Li-Shiuan Peh, Li Shang
openaire   +1 more source

BIG Cache Abstraction for Cache Networks

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), 2017
In this paper, we advocate the notion of "BIG" cache as an innovative abstraction for effectively utilizing the distributed storage and processing capacities of all servers in a cache network. The "BIG" cache abstraction is proposed to partly address the problem of (cascade) thrashing in a hierarchical network of cache servers, where it has been known ...
Eman Ramadan, Arvind Narayanan, Zhi-Li Zhang, Runhui Li, Gong Zhang   +4 more
openaire   +1 more source

A network calculus for cache networks

2013 Proceedings IEEE INFOCOM, 2013
Over the past few years Content-Centric Networking, a networking architecture in which host-to-content communication protocols are introduced, has been gaining much attention. A central component of such an architecture is a large-scale interconnected caching system.
Elisha J. Rosensweig, Jim Kurose
openaire   +1 more source

Caching in combination networks

2015 49th Asilomar Conference on Signals, Systems and Computers, 2015
We study the throughput of a network formed by one server, k "helpers" and n users. The users may request any file from a fixed library of m files, where each file can be regarded as the realization of an independent random variable with entropy F bits. The users can locally cache up to MF information bits.
Mingyue Ji, Antonia M. Tulino, Jaime Llorca, Giuseppe Caire   +3 more
openaire   +2 more sources

Online caching in heterogeneous networks

2017 IEEE International Conference on Communications (ICC), 2017
In this paper we propose a novel online caching method to perform the update phase in a distributed caching system, with a natural application to heterogeneous scenarios with cache-equipped small-cell base stations. We investigate the performance of our scheme, showing in particular that it results in a significant reduction of backhaul load, to the ...
Gabry F, Bioglio V, Land I
openaire   +2 more sources

Cache Networks of Counting Queues

IEEE/ACM Transactions on Networking, 2021
We consider a cache network in which intermediate nodes equipped with caches can serve content requests. We model this network as a universally stable queuing system, in which packets carrying identical responses are consolidated before being forwarded downstream.
Yuanyuan Li, Stratis Ioannidis
openaire   +1 more source

Tradeoff between PHY caching and core network caching in cellular networks

2016 IEEE International Conference on Communications (ICC), 2016
Recently, physical layer (PHY) caching at the base station (BS) has been proposed to induce MIMO cooperation among peer BSs to reduce interference and improve the spectrum efficiency in the radio access network (RAN). Compared with caching at the core network (CN) gateway (CN-caching), which covers a large number of users, it may appear that PHY ...
Wei Han 0004, An Liu 0001, Vincent K. N. Lau   +2 more
openaire   +1 more source