University of Oulu

A. O. Al-Abbasi, A. Elghariani, A. Elgabli and V. Aggarwal, "On the Information Freshness and Tail Latency Trade-Off in Mobile Networks," 2019 IEEE Global Communications Conference (GLOBECOM), Waikoloa, HI, USA, 2019, pp. 1-6, doi: 10.1109/GLOBECOM38437.2019.9013174

On the information freshness and tail latency trade-off in mobile networks

Saved in:
Author: Al-Abbasi, Abubakr O.1; Elghariani, Ali1; Elgabli, Anis2;
Organizations: 1Purdue University
2University of Oulu
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 0.6 MB)
Persistent link:
Language: English
Published: Institute of Electrical and Electronics Engineers, 2019
Publish Date: 2020-06-22


With the advent of emerging mission-critical applications, sampling information updates and scheduling mobile traffic in a timely manner are very challenging. In addition, maintaining fresh information and low latency communication is important to these applications. To that end, in this paper, we first derive closed-form expressions for the latency tail probability (LTP) and the average age of information (AoI) in M/G/1 systems, where shifted exponential service time is considered. Different from the majority of existing work in this domain, our analysis is derived assuming different update sizes with different priority levels. Next, we have developed novel policies for sampling and scheduling the information updates over the choice of one (or a set) of the parallel links, e.g., WiFi and LTE links. Then, a joint minimization of AoI and LTP is formulated and efficient algorithms are provided. Unlike queue-based policies, our scheduling approach over parallel links enjoys two key advantages. First, the scheduling decision is independent of the queue length and is thus less complex. Second, it can differentiate the updates of the apps to further prioritize the very-timely sensitive information (e.g control signals) over other messages that can tolerate more delay (e.g., status updates). Our evaluation results show significant improvements of the proposed approaches as compared to the state-of-the-art algorithms.

see all

Series: IEEE Global Communications Conference
ISSN: 2334-0983
ISSN-E: 2576-6813
ISSN-L: 2334-0983
ISBN: 978-1-7281-0962-6
ISBN Print: 978-1-7281-0963-3
Pages: 1 - 6
Article number: 9013174
DOI: 10.1109/GLOBECOM38437.2019.9013174
Host publication: 2019 IEEE Global Communications Conference, GLOBECOM 2019
Conference: IEEE Global Communications Conference
Type of Publication: A4 Article in conference proceedings
Field of Science: 213 Electronic, automation and communications engineering, electronics
Copyright information: © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.