Coding Instead of Splitting - Algebraic Combinations in Time and Space
Abstract
Our accomplishments fall into several categories. In [1] and [2], we consider different aspects of the problem of distributed function computation across a network and propose a network flow approach to characterize trade-offs between computation and communication costs. Moreover, we demonstrate an application of this framework in cloud computing. In [3], we consider a network coded distributed storage problem in highly dynamic environments where the nodes and the communication links availability is volatile. We propose a robust decentralized network coded approach that requires a small number of repair nodes for node recovery. In [4], we propose a reliable, multi-path protocol called Multi-Path TCP with Network Coding (MPTCP/NC) and show that it can provide users in mobile environments a higher quality of service by enabling the use of multiple network technologies and the capability to overcome packet losses. In [5], we introduce tunable sparse network coding (TSNC), a scheme in which the density of network coded packets varies during a transmission session. We also propose a family of tunable sparse codes for multicast erasure networks with a controllable trade-off between completion time performance and decoding complexity. In [6] and [7], we investigate different aspects of coding over a two unicast network such as the tightness of the generalized network sharing bound. We also develop a new linear network coding algorithm for two-unicast-Z networks over directed acyclic graphs.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 09, 2016
- Accession Number
- AD1011270
Entities
People
- Muriel Médard