Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each node is. Allowing a node to encode its received data be...

In communication networks, files commonly are separated into data packets and transmitted from the source node to a prescribed set of destination nodes by a method known as “store and forward”, in which data packets received are stored and then forwarded to the next node. Network coding has been proposed to replace the traditional “store and forward” model, and to improve the throughput and rob...

Motivated by practical networking scenarios, we introduce a notion of restricted communication called conservative networking. Consider a network of lossless links and a number of independent sources. Each node needs to recover a certain subset of the sources. However, each node is conservative in that all information it receives can only be a function of the sources it will ultimately recover....

Given a telecommunication network, modeled by a graph with capacities, we are interested in comparing the behavior and usefulness of two information propagation schemes, namely multicast and network coding, when the aforementioned network is subject to single arc failure. We consider the case with a single source node and a set of terminal nodes. The problem of studying the maximum quantity of ...