DeepAI AI Chat
Log In Sign Up

Age of Information in Multi-hop Networks with Priorities

by   Olga Vikhrova, et al.

Age of Information is a new metric used in real-time status update tracking applications. It measures at the destination the time elapsed since the generation of the last received packet. In this paper, we consider the co-existence of critical and noncritical status updates in a two-hop system, for which the network assigns different scheduling priorities. Specifically, the high priority is reserved to the packets that traverse the two nodes, as they experience worse latency performance. We obtain the distribution of the age and its natural upper bound termed peak age. We provide tight upper and lower bounds for priority updates and the exact expressions for the non-critical flow of packets with a general service distribution. The results give fundamental insights for the design of age-sensitive multi-hop systems.


page 1

page 2

page 3

page 4


Age of Information in Multihop Multicast Networks

We consider the age of information in a multihop multicast network where...

On the Age of Information of Short-Packet Communications with Packet Management

In this paper, we consider a point-to-point wireless communication syste...

Multicast With Prioritized Delivery: How Fresh is Your Data?

We consider a multicast network in which real-time status updates genera...

Information Freshness of Updates Sent over LEO Satellite Multi-Hop Networks

Low Earth Orbit (LEO) satellite constellations are bringing the Internet...

Age of Information in G/G/1/1 Systems: Age Expressions, Bounds, Special Cases, and Optimization

We consider the age of information in G/G/1/1 systems under two service ...

Age of Information in a Decentralized Network of Parallel Queues with Routing and Packets Losses

The paper deals with Age of Information in a network of multiple sources...

Age of Information With Non-Poisson Updates in Cache-Updating Networks

We study age of information in multi-hop multi-cast cache-enabled networ...