Provided by: Cornell University
In this paper, the authors study the multisource multicast problem where every sink in a given directed acyclic graph is a client and is interested in a common file. They consider the case where each node can have partial knowledge about the file as a side information. Assuming that nodes can communicate over the capacity constrained links of the graph, the goal is for each client to gain access to the file, while minimizing some linear cost function of number of bits transmitted in the network. They consider three types of side-information settings: side information in the form of linearly correlated packets; and the general setting where the side information at the nodes have an arbitrary (i.i.d.) correlation structure.