hh.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Statistical guarantee optimization for age of information for the D/G/1 queue
KTH Royal Institute of Technology, Stockholm, Sweden.
Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
KTH Royal Institute of Technology, Stockholm, Sweden.
2018 (Engelska)Ingår i: INFOCOM 2018 - IEEE Conference on Computer Communications Workshops, IEEE, 2018, s. 130-135Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
IEEE, 2018. s. 130-135
Nyckelord [en]
Optimization, Queueing theory, Approximation factor, D/M/1 queues, Heuristic solutions, Information updates, Minimization problems, Networked systems, Sampling rates, Statistical guarantee, Distribution functions
Nationell ämneskategori
Telekommunikation
Identifikatorer
URN: urn:nbn:se:hh:diva-38744DOI: 10.1109/INFCOMW.2018.8406909ISI: 000450157700086Scopus ID: 2-s2.0-85050654029ISBN: 9781538659793 (digital)ISBN: 978-1-5386-5980-9 (tryckt)OAI: oai:DiVA.org:hh-38744DiVA, id: diva2:1278087
Konferens
2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018, Honolulu, HI, USA, 15-19 April, 2018
Tillgänglig från: 2019-01-11 Skapad: 2019-01-11 Senast uppdaterad: 2019-01-11Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Al-Zubaidy, Hussein

Sök vidare i DiVA

Av författaren/redaktören
Al-Zubaidy, Hussein
Av organisationen
Halmstad Embedded and Intelligent Systems Research (EIS)
Telekommunikation

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 62 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf