Content Based Status Updates

Najm, Elie; Nasser, Rajai; Telatar, Emre

doi:10.1109/isit.2018.8437577

Cited by 38 publications

(31 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our analysis pertains a point-to-point link serving a single flow of data. The following are natural generalizations: (i) a pointto-point link serving multiple independent flows of information, possibly with different reliability, freshness, and latency requirements or priorities as in [37], [38]; (ii) a broadcast scenario with common information to be sent to all receivers; (iii) a broadcast scenario where independent information flows are to be sent to different receivers; (iv) the multiple-access case, where multiple sensors send information to a common destination; (v) the multihop setting where the objective is to maintain low end-to-end latency and high end-to-end data freshness.…”

Section: B Beyond the Point-to-point Setupmentioning

confidence: 99%

Reliable Transmission of Short Packets Through Queues and Noisy Channels Under Latency and Peak-Age Violation Guarantees

Devassy

Durisi

Ferrante

et al. 2019

IEEE J. Select. Areas Commun.

126

View full text Add to dashboard Cite

This work investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary memoryless Bernoulli process, placed in a single-server queue and then transmitted over a wireless channel. A variable-length stopfeedback coding scheme-a general strategy that encompasses simple automatic repetition request (ARQ) and more sophisticated hybrid ARQ techniques as special cases-is used by the transmitter to convey the information packets to the receiver. By leveraging finite-blocklength results, the delay violation and the peak-age violation probabilities are characterized without resorting to approximations based on large-deviation theory as in previous literature. Numerical results illuminate the dependence of delay and peak-age violation probability on system parameters such as the frame size and the undetected error probability, and on the chosen packet-management policy. The guidelines provided by our analysis are particularly useful for the design of low-latency ultrareliable communication systems.

show abstract

Section: B Beyond the Point-to-point Setupmentioning

confidence: 99%

Reliable Transmission of Short Packets Through Queues and Noisy Channels Under Latency and Peak-Age Violation Guarantees

Devassy

Durisi

Ferrante

et al. 2019

IEEE J. Select. Areas Commun.

126

View full text Add to dashboard Cite

show abstract

“…Having defined Y c in (30), we proceed to derive the MGF MYc (s) = E[e sYc ]. Let K c , Kc , and K c denote the random variables representing the numbers of occurrences of random variables η c , ηc , and η c , respectively.…”

Section: A Mgfs Of Aoi and Peak Aoi Under The Source-aware Preemptive...mentioning

confidence: 99%

“…Let K c , Kc , and K c denote the random variables representing the numbers of occurrences of random variables η c , ηc , and η c , respectively. Then, using (30), the MGF of Y c is calculated as…”

Section: A Mgfs Of Aoi and Peak Aoi Under The Source-aware Preemptive...mentioning

confidence: 99%

“…The average AoI and average peak AoI for a multi-source M/G/1/1 queueing model under the source-agnostic preemption policy were derived in [29]. In [30], the authors derived the average AoI for a queueing system with two classes of Poisson arrivals with different priorities under a general service time distribution. They assumed that the system can contain at most one packet and a newly arriving packet replaces the possible currently-in-service packet with the same or lower priority.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Moment Generating Function of Age of Information in Multi-Source M/G/1/1 Queueing Systems

Moltafet¹,

Leinonen²,

Codreanu³

2022

Preprint

View full text Add to dashboard Cite

We consider a multi-source status update system, where each source generates status update packets according to a Poisson process which are then served according to a generally distributed service time. For this multi-source M/G/1/1 queueing model, we introduce a source-aware preemptive packet management policy and derive the moment generating functions (MGFs) of the age of information (AoI) and peak AoI of each source. According to the policy, an arriving fresh packet preempts the possible packet of the same source in the system. Furthermore, we derive the MGFs of the AoI and peak AoI for the source-agnostic preemptive and non-preemptive policy, for which only the average AoI and peak AoI have been derived earlier. Finally, we use the MGFs to derive the average AoI and peak AoI in a two-source M/G/1/1 queueing model under each policy. Numerical results show the effect of the service time distribution parameters on the average AoI: for a given service rate, when the tail of the service time distribution is sufficiently heavy, the source-agnostic preemptive policy is the best policy, whereas for a sufficiently light tailed distribution, the non-preemptive policy is the best policy. The results also highlight the importance of higher moments of the AoI.

show abstract

“…They also show that the AoI obtained in their policies is a multiplicative factor away from the optimal value. In [8] the authors study the problem of giving pre-emptive priority to one flow over another, in a single queue system, and obtain closed-form expressions for average age and peak age. In works such as [9], [10], the problem of optimal sampling in order to minimize age is addressed, in the context of single hop transmission.…”

Section: Introductionmentioning

confidence: 99%

Minimizing Age of Information in a Multihop Wireless Network

Krishnan

Sharma

2020

ICC 2020 - 2020 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

We consider the problem of minimizing age in a multihop wireless network. There are multiple source-destination pairs, transmitting data through multiple wireless channels, over multiple hops. We propose a network control policy which consists of a distributed scheduling algorithm, utilizing channel state information and queue lengths at each link, in combination with a packet dropping rule. Dropping of older packets locally at queues is seen to reduce the average age of flows, even below what can be achieved by Last Come First Served (LCFS) scheduling. Dropping of older packets also allows us to use the network without congestion, irrespective of the rate at which updates are generated. Furthermore, exploiting system state information substantially improves performance. The proposed scheduling policy obtains average age values close to a theoretical lower bound as well.

show abstract

Content Based Status Updates

Cited by 38 publications

References 9 publications

Reliable Transmission of Short Packets Through Queues and Noisy Channels Under Latency and Peak-Age Violation Guarantees

Reliable Transmission of Short Packets Through Queues and Noisy Channels Under Latency and Peak-Age Violation Guarantees

Moment Generating Function of Age of Information in Multi-Source M/G/1/1 Queueing Systems

Minimizing Age of Information in a Multihop Wireless Network

Contact Info

Product

Resources

About