We formulate and study a data dissemination problem, which can be viewed as a generalization of the index coding problem and the data exchange problem to networks with an arbitrary topology. We define $$r-solvable networks, in which data dissemination can be achieved in $r > 0$ communication rounds. We show that the optimum number of transmission for any one-round communication scheme is given by the minimum rank of a certain constrained family of matrices. For general $r$-solvable networks, we derive an upper bound on the minimum number of transmissions in any scheme with $\geq r$ rounds.

Date

2016-04-29

Event

University of Tartu PhD student seminar

Location

Haanjamehe, Estonia

Links