We consider the communication capacity of wireline networks for a two-unicast traffic pattern. The network has two sources and two destinations with each source communicating a message to its own destination, subject to the capacity constraints on the directed edges of the network. We propose a simple outer bound for the problem that we call the Generalized Network Sharing (GNS) bound. We show ...

We consider the ability of a distributed randomized network coding approach to multicast, to one or more receivers, correlated sources over a network where compression may be required. We give, for two arbitrarily correlated sources in a general network, upper bounds on the probability of decoding error at each receiver, in terms of network parameters. In the special case of a Slepian-Wolf sour...

we consider a grid network where nodes contain small buffers. a packet that faces a crowded buffer in its route will get extra latency and may be dropped. in this paper, we propose a novel flow control protocol called rfcc for grid networks. rfcc tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...

This paper discusses random linear network coding with and without the use of a Vandermonde matrix to obtain the coding coefficients. Performance comparisons of such random linear network coded networks with networks employing traditional store and forward technique are also provided. It is shown that random linear network coding using a Vandermonde matrix can improve the network utilization fa...

Abstract Using random linear network coding (RLNC) in asynchronous networks with one-to-many information flow has already been proven to be a valid approach maximize the channel capacities. Message-based consensus protocols such as practical Byzantine fault tolerance (pBFT) adhere partially said scenario. Protocol phases many-to-many communication, however, still suffer from quadratic growth nu...

................................................................................................................................................... 2 List of Figures .......................................................................................................................................... 5

We show that the maximum possible energy benefit of network coding for multiple unicast on wireless networks is at least 3. This improves the previously known lower bound of 2.4 from [1].