Hyppää sisältöön
    • FI
    • ENG
  • FI
  • /
  • EN
OuluREPO – Oulun yliopiston julkaisuarkisto / University of Oulu repository
Näytä viite 
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Al-Abbasi, Abubakr O.; Elghariani, Ali; Elgabli, Anis; Aggarwal, Vaneet (2020-02-27)

 
Avaa tiedosto
nbnfi-fe2020062245151.pdf (642.4Kt)
nbnfi-fe2020062245151_meta.xml (32.93Kt)
nbnfi-fe2020062245151_solr.xml (31.99Kt)
Lataukset: 

URL:
https://doi.org/10.1109/GLOBECOM38437.2019.9013174

Al-Abbasi, Abubakr O.
Elghariani, Ali
Elgabli, Anis
Aggarwal, Vaneet
Institute of Electrical and Electronics Engineers
27.02.2020

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

https://rightsstatements.org/vocab/InC/1.0/
© 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.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1109/GLOBECOM38437.2019.9013174
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2020062245151
Tiivistelmä

Abstract

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.

Kokoelmat
  • Avoin saatavuus [37887]
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen
 

Selaa kokoelmaa

NimekkeetTekijätJulkaisuajatAsiasanatUusimmatSivukartta

Omat tiedot

Kirjaudu sisäänRekisteröidy
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen