Data Flow Dissemination in a Network
Aditya Gopalan, Alexander Stolyar

TL;DR
This paper analyzes data dissemination strategies in networks, comparing their stability and delay performance, especially focusing on Random-Useful and Oldest-Useful disciplines in symmetric and general network models.
Contribution
It establishes the maximum stability region for Random-Useful discipline and characterizes stability conditions for Oldest-Useful, with insights into delay behavior and performance comparisons.
Findings
RU has maximum stability in general networks
OU achieves maximum stability in symmetric networks
Delay behavior analyzed as network size grows
Abstract
We consider the following network model motivated, in particular, by blockchains and peer-to-peer live streaming. Data packet flows arrive at the network nodes and need to be disseminated to all other nodes. Packets are relayed through the network via links of finite capacity. A packet leaves the network when it is disseminated to all nodes. Our focus is on two communication disciplines, which determine the order in which packets are transmitted over each link, namely {\em Random-Useful} (RU) and {\em Oldest-Useful} (OU). We show that RU has the maximum stability region in a general network. For the OU we demonstrate that, somewhat surprisingly, it does {\em not} in general have the maximum stability region. We prove that OU does achieve maximum stability in the important special case of a symmetric network, given by the full graph with equal capacities on all links and equal arrival…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks · Cooperative Communication and Network Coding
