## Network Coding for Joint Storage and Transmission with Minimum Cost (2006)

Venue: | In ISIT |

Citations: | 20 - 0 self |

### BibTeX

@INPROCEEDINGS{Jiang06networkcoding,

author = {Anxiao (andrew Jiang},

title = {Network Coding for Joint Storage and Transmission with Minimum Cost},

booktitle = {In ISIT},

year = {2006}

}

### OpenURL

### Abstract

Abstract — Network coding provides elegant solutions to many data transmission problems. The usage of coding for distributed data storage has also been explored. In this work, we study a joint storage and transmission problem, where a source transmits a file to storage nodes whenever the file is updated, and clients read the file by retrieving data from the storage nodes. The cost includes the transmission cost for file update and file read, as well as the storage cost. We show that such a problem can be transformed into a pure flow problem and is solvable in polynomial time using linear programming. Coding is often necessary for obtaining the optimal solution with the minimum cost. However, we prove that for networks of generalized tree structures, where adjacent nodes can have asymmetric links between them, file splitting — instead of coding — is sufficient for achieving optimality. In particular, if there is no constraint on the numbers of bits that can be stored in storage nodes, there exists an optimal solution that always transmits and stores the file as a whole. The proof is accompanied by an algorithm that optimally assigns file segments to storage nodes. I.

### Citations

1113 | Network information flow
- Ahlswede, Cai, et al.
(Show Context)
Citation Context ...monly known as network coding, has been studied extensively. In particular, multicast using network coding achieves the network capacity, and the result extends the well known max-flow mincut theorem =-=[2]-=-. Linear coding and random linear coding [4] for network coding attract lots of interest due to their simplicity and optimal performance, both of great importance for applications. Network coding can ... |

145 | On randomized network coding
- Ho, Medard, et al.
(Show Context)
Citation Context ...ied extensively. In particular, multicast using network coding achieves the network capacity, and the result extends the well known max-flow mincut theorem [2]. Linear coding and random linear coding =-=[4]-=- for network coding attract lots of interest due to their simplicity and optimal performance, both of great importance for applications. Network coding can lower the complexity of data flow problems a... |

86 | Achieving minimum-cost multicast: a decentralized approach based on network coding
- Lun, Ratnakar, et al.
- 2005
(Show Context)
Citation Context ...ce, both of great importance for applications. Network coding can lower the complexity of data flow problems and lead to solutions that are decentralized or of improved performance in various aspects =-=[9]-=-. Both multicast and non-multicast [10], block codes and convolutional codes, linear coding and non-linear coding have been studied for network coding, and the complexity classification of those probl... |

77 |
Complexity classification of network information flow problems
- Rasala-Lehman, Lehman
- 2004
(Show Context)
Citation Context ...st [10], block codes and convolutional codes, linear coding and non-linear coding have been studied for network coding, and the complexity classification of those problems have been gaining attention =-=[12]-=-. Coding for data storage in distributed networks has also been studied. In [11], the following problem is studied: how to store a file distributedly such that every node can reconstruct the file by a... |

73 | How good is random linear coding based distributed networked storage
- Acedański, Deb, et al.
- 2005
(Show Context)
Citation Context ...e total number of bits stored in the network. In [5], [6], interleaving techniques are presented for placing codeword symbols on network nodes for optimized distributed file retrieval performance. In =-=[1]-=-, random linear coding is used for storage, and the scheme is shown to have high success rate for data retrieval. In this paper, we study a joint storage and transmission problem. It follows a commonl... |

69 | Network coding in undirected networks
- Li, Li
- 2004
(Show Context)
Citation Context ...olution where the file is stored and transmitted as a whole. The main result here improves the current knowledge on the performance gap between approaches respectively using and not using coding [3], =-=[8]-=-. The findings can potentially lead to solutions with substantially lower complexity and simpler forms, both of which are important for network applications. The rest of the paper is organized as foll... |

47 |
On the advantage of network coding for improving network throughput
- Agarwal, Charikar
(Show Context)
Citation Context ...mal solution where the file is stored and transmitted as a whole. The main result here improves the current knowledge on the performance gap between approaches respectively using and not using coding =-=[3]-=-, [8]. The findings can potentially lead to solutions with substantially lower complexity and simpler forms, both of which are important for network applications. The rest of the paper is organized as... |

45 | On coding for non-multicast networks
- Medard, Effros, et al.
- 2003
(Show Context)
Citation Context ...cations. Network coding can lower the complexity of data flow problems and lead to solutions that are decentralized or of improved performance in various aspects [9]. Both multicast and non-multicast =-=[10]-=-, block codes and convolutional codes, linear coding and non-linear coding have been studied for network coding, and the complexity classification of those problems have been gaining attention [12]. C... |

36 |
Optimal Placement of Replicas in Trees with Read
- Kalpakis, Dasgupta, et al.
- 2001
(Show Context)
Citation Context ...y of finding a solution. Especially, when the file is transmitted and stored as a whole, the problem reduces to the traditional file assignment problem and can be solved in low degree polynomial time =-=[7]-=-. Also, file splitting removes the complexity of encoding and decoding. V. CONCLUSIONS We have studied a joint storage and transmission problem, and shown that it can be transformed into an LP multica... |

26 | Optimal file sharing in distributed networks
- Naor, Roth
- 1995
(Show Context)
Citation Context ...g have been studied for network coding, and the complexity classification of those problems have been gaining attention [12]. Coding for data storage in distributed networks has also been studied. In =-=[11]-=-, the following problem is studied: how to store a file distributedly such that every node can reconstruct the file by accessing the data stored on itself and its direct neighbors. The objective is to... |

9 | Network file storage with graceful performance degradation
- Jiang, Bruck
- 2005
(Show Context)
Citation Context ...dly such that every node can reconstruct the file by accessing the data stored on itself and its direct neighbors. The objective is to minimize the total number of bits stored in the network. In [5], =-=[6]-=-, interleaving techniques are presented for placing codeword symbols on network nodes for optimized distributed file retrieval performance. In [1], random linear coding is used for storage, and the sc... |

4 | Multicluster interleaving on paths and cycles
- Jiang, Bruck
(Show Context)
Citation Context ...ibutedly such that every node can reconstruct the file by accessing the data stored on itself and its direct neighbors. The objective is to minimize the total number of bits stored in the network. In =-=[5]-=-, [6], interleaving techniques are presented for placing codeword symbols on network nodes for optimized distributed file retrieval performance. In [1], random linear coding is used for storage, and t... |