English
Related papers

Related papers: Information Freshness in Cache Updating Systems

200 papers

Caching appears to be an efficient way to reduce peak hour network traffic congestion by storing some content at the user's cache without knowledge of later demands. Recently, Maddah-Ali and Niesen proposed a two-phase, placement and…

Information Theory · Computer Science 2016-01-28 Kai Wan , Daniela Tuninetti , Pablo Piantanida

This paper is motivated by emerging edge computing systems which consist of sensor nodes that acquire and process information and then transmit status updates to an edge receiver for possible further processing. As power is a scarce…

Information Theory · Computer Science 2020-03-31 Parisa Rafiee , Peng Zou , Omur Ozel , Suresh Subramaniam

We consider a scenario where a monitor is interested in being up to date with respect to the status of some system which is not directly accessible to this monitor. However, we assume a source node has access to the status and can send…

Information Theory · Computer Science 2016-04-06 Elie Najm , Rajai Nasser

We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with $N$ files of equal length $F$, and serves $K$ users each with a cache memory of $MF$…

Information Theory · Computer Science 2017-05-24 Jesús Gómez-Vilardebó

Coded caching (CC) schemes exploit the cumulative cache memory of the users and simple linear coding to turn unicast traffic (individual file requests) into a multicast transmission. For the originally proposed $K$-user single-server/single…

Information Theory · Computer Science 2024-03-12 Kagan Akcay , MohammadJavad Salehi , Giuseppe Caire

Consider a scenario where a source continuously monitors an object and sends time-stamped status updates to a destination through a rate-limited link. In order to measure the "freshness" of the status information available at the…

Information Theory · Computer Science 2018-07-03 Boyu Wang , Songtao Feng , Jing Yang

We consider a basic caching system, where a single server with a database of $N$ files (e.g. movies) is connected to a set of $K$ users through a shared bottleneck link. Each user has a local cache memory with a size of $M$ files. The…

Information Theory · Computer Science 2018-09-03 Qian Yu , Mohammad Ali Maddah-Ali , A. Salman Avestimehr

We consider a variant of the coded caching problem where users connect to two types of caches, called private and access caches. The problem setting consists of a server with a library of files and a set of access caches. Each user,…

Information Theory · Computer Science 2024-07-02 Dhruv Pratap Singh , Anjana A. Mahesh , B. Sundar Rajan

A sensor node that is sending measurement updates regarding some physical phenomenon to a destination is considered. The sensor relies on energy harvested from nature to transmit its updates, and is equipped with a finite $B$-sized battery…

Information Theory · Computer Science 2018-02-26 Ahmed Arafa , Jing Yang , Sennur Ulukus , H. Vincent Poor

Caching of popular content on wireless nodes is recently proposed as a means to reduce congestion in the backbone of cellular networks and to improve Quality of Service. From a network point of view, the goal is to offload as many users as…

Networking and Internet Architecture · Computer Science 2017-07-11 Jonatan Krolikowski , Anastasios Giovanidis , Marco Di Renzo

Multimedia content streaming from Internet-based sources emerges as one of the most high demanded services by wireless users. In order to alleviate excessive traffic due to multimedia content transmission, many architectures (e.g., small…

Networking and Internet Architecture · Computer Science 2019-07-05 Ioannis Avgouleas , Nikolaos Pappas , Vangelis Angelakis

Edge computing applications typically require generated data to be preprocessed at the source and then transmitted to an edge server. In such cases, transmission time and preprocessing time are coupled, yielding a tradeoff between them to…

Information Theory · Computer Science 2019-12-06 Peng Zou , Omur Ozel , Suresh Subramaniam

Current day processors employ multi-level cache hierarchy with one or two levels of private caches and a shared last-level cache (LLC). An efficient cache replacement policy at LLC is essential for reducing the off-chip memory transfer as…

Hardware Architecture · Computer Science 2013-07-25 Bijay Paikaray

Received samples of a stochastic process are processed by a server for delivery as updates to a monitor. Each sample belongs to a class that specifies a distribution for its processing time and a function that describes how the value of the…

Information Theory · Computer Science 2024-08-23 Ahmed Arafa , Roy D. Yates

A status updating system is considered in which multiple processes are sampled and transmitted through a shared channel. Each process has its dedicated server that processes its samples before time stamping them for transmission. Time…

Information Theory · Computer Science 2025-04-09 Md Nurul Absar Siddiky , Ahmed Arafa

In a secure coded caching system, a central server balances the traffic flow between peak and off-peak periods by distributing some public data to the users' caches in advance. Meanwhile, these data are securely protected against the…

Information Theory · Computer Science 2019-10-21 Kangning Ma , Shuo Shao

Consider an energy harvesting (EH) sensor that continuously monitors a system and sends time-stamped status update to a destination. The sensor harvests energy from nature and uses it to power its updating operations. The destination keeps…

Information Theory · Computer Science 2019-05-14 Songtao Feng , Jing Yang

Query-based sampling has become an increasingly popular technique for monitoring Markov sources in pull-based update systems. However, most of the contemporary literature on this assumes an exponential distribution for query delay and often…

Information Theory · Computer Science 2026-04-21 Sahan Liyanaarachchi , Sennur Ulukus , Nail Akar

Efficient consistency maintenance of incomplete and dynamic real-life databases is a quality label for further data analysis. In prior work, we tackled the generic problem of database updating in the presence of tuple generating constraints…

Databases · Computer Science 2024-05-16 Jacques Chabin , Mirian Halfeld Ferrari , Nicolas Hiot , Dominique Laurent

The last decade has witnessed an unprecedented growth in the demand for data-driven real-time services. These services are fueled by emerging applications that require rapidly injecting data streams and computing updated analytics results…

Performance · Computer Science 2019-03-05 Zhongdong Liu , Bo Ji