Optimization-Based Linear Network Coding for General Connections of Continuous Flows
Name
1502.06601.pdf
Description
Submitted version
Size
233.72 KB
Format
Adobe PDF
Checksum (MD5)
5ef181d6ed52e7578cac2518232de82e
Author(s)
Cui, Ying
Medard, Muriel
Yeh, Edmund
Leith, Douglas
Duffy, Ken R
Date Issued
2018
Journal
Networking, IEEE-ACM Transactions on
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Version
Original manuscript
Abstract
© 1993-2012 IEEE. For general connections, the problem of finding network codes and optimizing resources for those codes is intrinsically difficult and a little is known about its complexity. Most of the existing methods for identifying solutions rely on very restricted classes of network codes in terms of the number of flows allowed to be coded together, and are not entirely distributed. In this paper, we consider a new method for constructing linear network codes for general connections of continuous flows to minimize the total cost of the edge use based on mixing. We first formulate the minimum-cost network coding design problem. To solve the optimization problem, we propose two equivalent alternative formulations with discrete mixing and continuous mixing, respectively, and develop distributed algorithms to solve them. Our approach fairly allows general coding across flows and guarantees no greater cost than existing solutions. Numerical results illustrate the performance of our approach.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
10.1109/TNET.2018.2865534
https://doi.org/10.1109/TNET.2018.2865534
