Optimization-based linear network coding for general connections of continuous flows
Name
Medard_Optimization-based.pdf
Size
219.03 KB
Format
Adobe PDF
Checksum (MD5)
a58c4e7b500e0e05ab76719fbbbfbafc
Author(s)
Cui, Ying
Medard, Muriel
Yeh, Edmund
Leith, Douglas
Duffy, Ken
Date Issued
June 2015
Journal
Proceedings of the 2015 IEEE International Conference on Communications (ICC)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Cui, Ying, Muriel Medard, Edmund Yeh, Douglas Leith, and Ken Duffy. “Optimization-Based Linear Network Coding for General Connections of Continuous Flows.” 2015 IEEE International Conference on Communications (ICC) (June 2015).
Version
Original manuscript
Abstract
For general connections, the problem of finding network codes and optimizing resources for those codes is intrinsically difficult and little is known about its complexity. Most of the existing 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 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 allows fairly general coding across flows and guarantees no greater cost than any solution without inter-flow network coding.
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
https://doi.org/10.1109/ICC.2015.7249030
