pith. sign in

arxiv: 1805.11720 · v1 · pith:43UXV3NCnew · submitted 2018-05-29 · 💻 cs.IT · math.IT

The Age of Updates in a Simple Relay Network

classification 💻 cs.IT math.IT
keywords streamaveragepacketsserversimplestreamstoolsupdates
0
0 comments X
read the original abstract

In this paper, we examine a system where status updates are generated by a source and are forwarded in a First-Come-First-Served (FCFS) manner to the monitor. We consider the case where the server has other tasks to fulfill, a simple example being relaying the packets of another stream. Due to the server's necessity to go on vacations, the age process of the stream of interest becomes complicated to evaluate. By leveraging specific queuing theory tools, we provide a closed form of the average age for both streams which enables us to optimize the generation rate of packets belonging to each stream to achieve the minimum possible average age. The tools used can be further adopted to provide insights on more general multi-hop scenarios. Numerical results are provided to corroborate the theoretical findings and highlight the interaction between the two streams.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Trading Off Computation with Transmission in Status Update Systems

    cs.IT 2019-07 unverdicted novelty 4.0

    Derives closed-form average and peak AoI for a tandem M/GI/1/1 and GI/M/1/2* queue system with dependent service times between computation and transmission.