hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Statistical guarantee optimization for age of information for the D/G/1 queue
KTH Royal Institute of Technology, Stockholm, Sweden.
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS).
KTH Royal Institute of Technology, Stockholm, Sweden.
2018 (English)In: INFOCOM 2018 - IEEE Conference on Computer Communications Workshops, IEEE, 2018, p. 130-135Conference paper, Published paper (Refereed)
Abstract [en]

Age of Information (AoI) has proven to be a useful metric in networked systems where timely information updates are of importance. Recently, minimizing the 'average age' has received considerable attention. However, various applications pose stricter age requirements on the updates which demand knowledge of the AoI distribution. In this work, we study the distribution of the AoI and devise a problem of minimizing the tail of the AoI distribution function with respect to the frequency of generating information updates, i.e., the sampling rate of monitoring a process, for the D/G/1 queue model under FCFS queuing discipline. We argue that computing an exact expression for the AoI distribution may not always be feasible. Therefore, we opt for computing a bound on the tail of the AoI distribution and use it to formulate a tractable a-relaxed Upper Bound Minimization Problem (a-UBMP), where a > 1 is an approximation factor. This approximation can be used to obtain 'good' heuristic solutions. We demonstrate the efficacy of our approach by solving a-UBMP for the D/M/1 queue. We show, using simulation, that the rate solutions obtained are near optimal for minimizing the tail of the AoI distribution. © 2018 IEEE.

Place, publisher, year, edition, pages
IEEE, 2018. p. 130-135
Keywords [en]
Optimization, Queueing theory, Approximation factor, D/M/1 queues, Heuristic solutions, Information updates, Minimization problems, Networked systems, Sampling rates, Statistical guarantee, Distribution functions
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:hh:diva-38744DOI: 10.1109/INFCOMW.2018.8406909ISI: 000450157700086Scopus ID: 2-s2.0-85050654029ISBN: 9781538659793 (electronic)ISBN: 978-1-5386-5980-9 (print)OAI: oai:DiVA.org:hh-38744DiVA, id: diva2:1278087
Conference
2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018, Honolulu, HI, USA, 15-19 April, 2018
Available from: 2019-01-11 Created: 2019-01-11 Last updated: 2019-01-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Al-Zubaidy, Hussein

Search in DiVA

By author/editor
Al-Zubaidy, Hussein
By organisation
Halmstad Embedded and Intelligent Systems Research (EIS)
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 45 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf