iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.48550/arXiv.2310.00243
[2310.00243] Age-Optimal Multi-Flow Status Updating with Errors: A Sample-Path Approach
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 > Networking and Internet Architecture

arXiv:2310.00243 (cs)
[Submitted on 30 Sep 2023 (v1), last revised 3 Oct 2023 (this version, v2)]

Title:Age-Optimal Multi-Flow Status Updating with Errors: A Sample-Path Approach

Authors:Yin Sun, Sastry Kompella
View PDF
Abstract:In this paper, we study an age of information minimization problem in continuous-time and discrete-time status updating systems that involve multiple packet flows, multiple servers, and transmission errors. Four scheduling policies are proposed. We develop a unifying sample-path approach and use it to show that, when the packet generation and arrival times are synchronized across the flows, the proposed policies are (near) optimal for minimizing any time-dependent, symmetric, and non-decreasing penalty function of the ages of the flows over time in a stochastic ordering sense.
Comments: Accepted by the Journal of Communications and Networks (JCN) Special Issue. arXiv admin note: substantial text overlap with arXiv:1801.02394
Subjects: Networking and Internet Architecture (cs.NI); Information Theory (cs.IT); Performance (cs.PF); Social and Information Networks (cs.SI); Systems and Control (eess.SY)
Cite as: arXiv:2310.00243 [cs.NI]
  (or arXiv:2310.00243v2 [cs.NI] for this version)
  https://doi.org/10.48550/arXiv.2310.00243

Submission history

From: Yin Sun [view email]
[v1] Sat, 30 Sep 2023 03:54:39 UTC (1,792 KB)
[v2] Tue, 3 Oct 2023 05:09:38 UTC (1,792 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.NI
< prev   |   next >
new | recent | 2023-10
Change to browse by:
cs
cs.IT
cs.PF
cs.SI
cs.SY
eess
eess.SY
math
math.IT

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?)