Publication

Content Based Status Updates

Related publications (33)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Yunus Inan

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

EPFL2023

Gaussian and sparse processes are limits of generalized Poisson processes

Michaël Unser, Julien René Pierre Fageot, Virginie Sophie Uhlmann

The theory of sparse stochastic processes offers a broad class of statistical models to study signals, far beyond the more classical class of Gaussian processes. In this framework, signals are represented as realizations of random processes that are soluti ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2020

We study some linear and nonlinear shot noise models where the jumps are drawn from a compound Poisson process with jump sizes following an Erlang-m distribution. We show that the associated Master equation can be written as a spatial mth order partial dif ...

Springer2019

Contact process under renewals I

We investigate a non-Markovian analogue of the Harris contact process in Z(d): an individual is attached to each site x is an element of Z(d), and it can be infected or healthy; the infection propagates to healthy neighbours just as in the usual contact pr ...

ELSEVIER SCIENCE BV2019

Content Based Status Updates

Emre Telatar, Elie Najm, Rajai Nasser

Consider a stream of status updates generated by a source, where each update is of one of two types: priority or ordinary; these updates are to be transmitted through a network to a monitor. We analyze a transmission policy that treats updates depending on ...

2018

, ,

IEEE2018

Cyber-physical systems (CPSs) are real-world processes that are controlled by computer algorithms. We consider CPSs where a centralized, software-based controller maintains the process in a desired state by exchanging measurements and setpoints with proces ...

EPFL2018

The mean-field behavior of processor sharing systems with general job lengths under the SQ(d) policy

Arpan Mukhopadhyay

This paper addresses the mean-field behavior of large-scale systems of parallel servers with a processor sharing service discipline when arrivals are Poisson and jobs have general service time distributions when an SQ(d) routing policy is used. Under this ...

ELSEVIER SCIENCE BV2018

Status Updates in a multi-stream M/G/1/1 preemptive queue

Emre Telatar, Elie Najm

We consider a source that collects a multiplicity of streams of updates and sends them through a network to a monitor. However, only a single update can be in the system at a time. Therefore, the transmitter always preempts the packet being served when a n ...

IEEE2018

Age of Information: The Gamma Awakening

Elie Najm, Rajai Nasser

Status update systems is an emerging field of study that is gaining interest in the information theory community. 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 acces ...

2016