Data Flow Dissemination in a Network

10/18/2021
by   Aditya Gopalan, et al.
0

We consider the following network model motivated, in particular, by blockchains and peer-to-peer live streaming. Data packet flows originate at the network nodes and need to be disseminated to all other nodes. Packets are relayed through the network via links of limited capacity. A packet leaves the network when it is disseminated to all nodes. The network is stable when it is positive recurrent; and when it is, the age of the oldest packet, referred to as Age-of-Information (AoI) is stochastically bounded. Under the Random-Useful (RU) discipline a node u communicates on link (u,v) a randomly chosen available packet not present at v. RU discipline is known to have the maximum stability region for a single flow; we show that this extends to arbitrary number of flows. Our main results concern the Oldest-Useful (OU) discipline, under which a node u communicates on link (u,v) the oldest available packet not present at v. OU discipline is a natural candidate for reducing the AoI. We show that, surprisingly, OU does not provide the maximum stability region. As the main result of this paper, we prove that OU does have the maximum stability region in the important special case of a complete graph network with equal capacities on all links and equal flow rates originating in all nodes. Simulation results show that, in the latter special case, OU out-performs RU in terms of AoI.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2018

Age of Information Performance of Multiaccess Strategies with Packet Management

We consider a system consisting of N source nodes communicating with a c...
research
08/18/2020

Age of Information in Random Access Networks: A Spatiotemporal Study

We investigate the age-of-information (AoI) in the context of random acc...
research
11/28/2017

Towards Provably Invisible Network Flow Fingerprints

Network traffic analysis reveals important information even when message...
research
09/23/2018

Fundamental Limits of Invisible Flow Fingerprinting

Network flow fingerprinting can be used to de-anonymize communications o...
research
04/28/2022

Discrete Packet Management: Analysis of Age of Information of Discrete Time Status Updating Systems

In this paper, we consider performing packet managements in discrete tim...
research
09/18/2021

Spatiotemporal Analysis for Age of Information in Random Access Networks under Last-Come First-Serve with Replacement Protocol

We investigate the age-of-information (AoI) in the context of random acc...
research
10/11/2022

Network Topology Inference based on Timing Meta-Data

Consider a processor having access only to meta-data consisting of the t...

Please sign up or login with your details

Forgot password? Click here to reset