[go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Performance

arXiv:2208.03022 (cs)
[Submitted on 5 Aug 2022]

Title:A Probabilistic Bound for Peak Age of Information Guarantee

Authors:Ailing Zhong, Zhidu Li, Tong Tang, Dapeng Wu, Ruyan Wang, Yuming Jiang
View PDF
Abstract:This paper considers the distribution of a general peak age of information (AoI) model and develops a general analysis approach for probabilistic performance guarantee from the time-domain perspective. Firstly, a general relationship between the peak AoI and the inter-arrival and service times of packets is revealed. With the help of martingale theory, a probabilistic bound on the peak AoI is then derived for the general case of endogenous independently and identically distributed increments in information generation and transmission processes. Thereafter, the application of the obtained bound is illustrated with the M/M/1 and D/M/1 queuing models. The validity of the proposed bound is finally examined with numerical results.
Subjects: Performance (cs.PF)
Cite as: arXiv:2208.03022 [cs.PF]
  (or arXiv:2208.03022v1 [cs.PF] for this version)
  https://doi.org/10.48550/arXiv.2208.03022

Submission history

From: Yuming Jiang [view email]
[v1] Fri, 5 Aug 2022 07:24:58 UTC (295 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.PF
< prev   |   next >
new | recent | 2022-08
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)