The stationary distribution of the age of information in FCFS single-server queues

Inoue, Yoshihisa; Masuyama, Hiroyuki; Takine, Tetsuya; Tanaka, Toshiyuki

doi:10.1109/isit.2017.8006592

Cited by 85 publications

(66 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a result the ρ e that minimizes the upper-bound(s), in Lemma 4, is independent of f e . Furthermore, the upper-bounds in Lemma 4 are nothing but the peak and average age expressions for the continuous time D/M/1 queue [7], [20], [46]. Let ρ p and ρ ave minimizes the peak age and average age upper-bounds in (39) and (40), respectively.…”

Section: Periodic Generation Of Update Packetsmentioning

confidence: 99%

Optimizing Information Freshness in Wireless Networks Under General Interference Constraints

Talak

Karaman

Modiano

2020

IEEE/ACM Trans. Networking

120

View full text Add to dashboard Cite

Age of information (AoI) is a recently proposed metric for measuring information freshness. AoI measures the time that elapsed since the last received update was generated. We consider the problem of minimizing average and peak AoI in a wireless networks, consisting of a set of source-destination links, under general interference constraints. When fresh information is always available for transmission, we show that a stationary scheduling policy is peak age optimal. We also prove that this policy achieves average age that is within a factor of two of the optimal average age. In the case where fresh information is not always available, and packet/information generation rate has to be controlled along with scheduling links for transmission, we prove an important separation principle: the optimal scheduling policy can be designed assuming fresh information, and independently, the packet generation rate control can be done by ignoring interference. Peak and average AoI for discrete time G/Ber/1 queue is analyzed for the first time, which may be of independent interest. arXiv:1803.06467v2 [cs.IT] 9 Dec 2019Lemma 1: We have A ave (π) = A p (π) for any stationary policy π ∈ Π st .

show abstract

Section: Periodic Generation Of Update Packetsmentioning

confidence: 99%

Optimizing Information Freshness in Wireless Networks Under General Interference Constraints

Talak

Karaman

Modiano

2020

IEEE/ACM Trans. Networking

120

View full text Add to dashboard Cite

show abstract

“…Authors in [22] further considered a symbol erasure transmission channel and studied the effect of packet preemption on the average AoI when adopting two hybrid ARQ protocols. For IoT networks with arbitrary distributions of the update inter-arrival time and service time, the relation among the distributions of the AoI, PAoI and system delay was derived in [23], while the effect of packet preemption on the AoI was investigated in [24]. Focusing on the one hop transmission from a data source to a destination, authors in [25] introduced a general penalty function to characterize the effect of AoI, and developed efficient algorithms to find the optimal update policy for minimizing the average penalty among all causal update policies.…”

Section: Related Workmentioning

confidence: 99%

Optimizing Information Freshness in Computing-Enabled IoT Networks

Yang

Wang

et al. 2020

IEEE Internet Things J.

View full text Add to dashboard Cite

Internet of Things (IoT) has emerged as one of the key features of the next generation wireless networks, where timely delivery of status update packets is essential for many realtime IoT applications. To provide users with context-aware services and lighten the transmission burden, the raw data usually needs to be preprocessed before being transmitted to the destination. However, the effect of computing on the overall information freshness is not well understood. In this work, we first develop an analytical framework to investigate the information freshness, in terms of peak age of information (PAoI), of a computing enabled IoT system with multiple sensors. Specifically, we model the procedure of computing and transmission as a tandem queue, and derive the analytical expressions of the average PAoI for different sensors. Based on the theoretical results, we formulate a minmax optimization problem to minimize the maximum average PAoI of different sensors. We further design a derivative-free algorithm to find the optimal updating frequency, with which the complexity for checking the convexity of the formulated problem or obtaining the derivatives of the object function can be largely reduced. The accuracy of our analysis and effectiveness of the proposed algorithm are verified with extensive simulation results.Index Terms-Internet of things, information freshness, peak age of information, data preprocessing, derivative-free optimization.

show abstract

“…In words, it is the sum of the service time of the mth bulk S m and the maximum between the delay D m−1 of the (m − 1)th bulk of packets and the difference T m − T m−1 between the frame indices corresponding to the arrival of the mth and the (m − 1)th bulks. The PGF of the steady-state peak age A p = max(D, T 2 − T 1 ) + S 1 can be derived similarly as in [17,Thm. 9] and is given in the next theorem.…”

Section: Steady-state Peak-age Violation Probabilitymentioning

confidence: 99%

Delay and Peak-Age Violation Probability in Short-Packet Transmissions

Devassy

Durisi

Ferrante

et al. 2018

2018 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

This paper investigates the distribution of delay and peak age of information in a communication system where packets, generated according to an independent and identically distributed Bernoulli process, are placed in a single-server queue with firstcome first-served discipline and transmitted over an additive white Gaussian noise (AWGN) channel. When a packet is correctly decoded, the sender receives an instantaneous error-free positive acknowledgment, upon which it removes the packet from the buffer. In the case of negative acknowledgment, the packet is retransmitted. By leveraging finite-blocklength results for the AWGN channel, we characterize the delay violation and the peak-age violation probability without resorting to approximations based on large deviation theory as in previous literature. Our analysis reveals that there exists an optimum blocklength that minimizes the delay violation and the peak-age violation probabilities. We also show that one can find two blocklength values that result in very similar average delay but significantly different delay violation probabilities. This highlights the importance of focusing on violation probabilities rather than on averages.Index Terms-Delay, finite blocklength, age of information, queuing.

show abstract

The stationary distribution of the age of information in FCFS single-server queues

Cited by 85 publications

References 5 publications

Optimizing Information Freshness in Wireless Networks Under General Interference Constraints

Optimizing Information Freshness in Wireless Networks Under General Interference Constraints

Optimizing Information Freshness in Computing-Enabled IoT Networks

Delay and Peak-Age Violation Probability in Short-Packet Transmissions

Contact Info

Product

Resources

About