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
On the Distribution of AoI for the GI/GI/1/1 and GI/GI/1/2*Systems: Exact Expressions and Bounds
KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.ORCID iD: 0000-0002-5127-8497
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems Engineering.ORCID iD: 0000-0002-0150-2489
KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.ORCID iD: 0000-0001-6682-6559
2019 (English)In: IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2019), IEEE , 2019, p. 37-45Conference paper, Published paper (Refereed)
Abstract [en]

Since Age of Information (AoI) has been proposed as a metric that quantifies the freshness of information updates in a communication system, there has been a constant effort in understanding and optimizing different statistics of the AoI process for classical queueing systems. In addition to classical queuing systems, more recently, systems with no queue or a unit capacity queue storing the latest packet have been gaining importance as storing and transmitting older packets do not reduce AoI at the receiver. Following this line of research, we study the distribution of AoI for the GI/GI/1/1 and GI/GI/1/2* systems, under non-preemptive scheduling. For any single-source-single-server queueing system, we derive, using sample path analysis, a fundamental result that characterizes the AoI violation probability, and use it to obtain closed-form expressions for D/GI/1/1, M/GI/1/1 as well as systems that use zero-wait policy. Further, when exact results are not tractable, we present a simple methodology for obtaining upper bounds for the violation probability for both GI/GI/1/1 and GI/GI/1/2* systems. An interesting feature of the proposed upper bounds is that, if the departure rate is given, they overestimate the violation probability by at most a value that decreases with the arrival rate. Thus, given the departure rate and for a fixed average service, the bounds are tighter at higher utilization.

Place, publisher, year, edition, pages
IEEE , 2019. p. 37-45
Series
IEEE INFOCOM, ISSN 0743-166X
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-257830DOI: 10.1109/INFOCOM.2019.8737474ISI: 000480426400006Scopus ID: 2-s2.0-85068226121ISBN: 978-1-7281-0515-4 (print)OAI: oai:DiVA.org:kth-257830DiVA, id: diva2:1348953
Conference
IEEE Conference on Computer Communications (IEEE INFOCOM), APR 29-MAY 02, 2019, Paris, FRANCE
Note

QC 20190906

Available from: 2019-09-06 Created: 2019-09-06 Last updated: 2019-09-06Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Champati, Jaya PrakashAl-Zubaidy, HusseinGross, James

Search in DiVA

By author/editor
Champati, Jaya PrakashAl-Zubaidy, HusseinGross, James
By organisation
Information Science and EngineeringNetwork and Systems Engineering
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 35 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