14 citations · 16 across the 5 of their papers we have counts for
8 papers
Optimal Age over Erasure Channels
Elie Najm, Emre Telatar, Rajai Nasser
Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, give…
Simplex Queues for Hot-Data Download
Mehmet Fatih Aktas, Elie Najm, Emina Soljanin
In cloud storage systems, hot data is usually replicated over multiple nodes in order to accommodate simultaneous access by multiple users as well as increase the fault tolerance o…
Status Updates in a multi-stream M/G/1/1 preemptive queue
Elie Najm, Emre Telatar
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.…
Content Based Status Updates
Elie Najm, Rajai Nasser, Emre Telatar
Consider a stream of status updates generated by a source, where each update is of one of two types: high priority or ordinary (low priority). These updates are to be transmitted t…
Status updates through M/G/1/1 queues with HARQ
Elie Najm, Roy D. Yates, Emina Soljanin
We consider a system where randomly generated updates are to be transmitted to a monitor, but only a single update can be in the transmission service at a time. Therefore, the sour…
Timely Updates over an Erasure Channel
Roy D. Yates, Elie Najm, Emina Soljanin +1
Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/receiver. We start by deriving the average stat…