Learn More
—We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. We show that this achieves capacity with probability exponentially approaching 1 with the(More)
— We present a novel randomized network coding approach for robust, distributed transmission and compression of information in networks, and demonstrate its advantages over routing-based approaches. We present a randomized network coding approach for robust , distributed transmission and compression of information in networks. Network nodes transmit on each(More)
We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links over some field. This approach was first described in [3], which gave, for acyclic delay-free networks, a bound on error probability, in terms of the number of(More)
We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast(More)
—We examine the problem of allocating a given total storage budget in a distributed storage system for maximum reliability. A source has a single data object that is to be coded and stored over a set of storage nodes; it is allowed to store any amount of coded data in each node, as long as the total amount of storage used does not exceed the given budget. A(More)
— Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information reaching a destination, preventing decoding. This paper introduces distributed polynomial-time rate-optimal network codes that work(More)
— We consider distributed space-time coding for two-way wireless relay networks, where communication between two terminals is assisted by relay nodes. We compare existing and new protocols that operate over 2, 3 or 4 times slots. Particularly, a new class of relaying protocols, termed as partial decode-and-forward (PDF), is proposed for the 2 time slots(More)
We consider the issue of coding for non-multicast networks. For multicast networks , it is known that linear operations over a field no larger than the number of receivers are sufficient to achieve all feasible connections. In the case of non-multicast networks, necessary and sufficient conditions are known, if we restrict ourselves to linear codes over a(More)
We establish, for multiple multicast sessions with intra-session network coding, the capacity region of input rates for which the network remains stable in ergodi-cally time-varying networks. Building on the back-pressure approach introduced by Tassiulas et al., we present dynamic algorithms for multicast routing, network coding , rate control, power(More)
Network coding generalizes network operation beyond traditional routing, or store-and-forward, approaches, allowing for mathematical operations across data streams within a network. This thesis considers a number of theoretical and practical networking issues from network coding perspectives. We describe a new distributed randomized coding approach to(More)