Cui, Ying and Medard, Muriel and Yeh, Edmund and Leith, Douglas and Duffy, Ken R. (2018) Optimization-Based Linear Network Coding for General Connections of Continuous Flows. IEEE/ACM Transactions on Networking, 26 (5). pp. 2033-2047. ISSN 1063-6692

Preview

Download (619kB) | Preview

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 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 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 existing solutions. Numerical results illustrate the performance of our approach.

Item Type:	Article
Keywords:	Network coding; network mixing; general connection; resource optimization; distributed algorithm;
Academic Unit:	Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Item ID:	15207
Identification Number:	https://doi.org/10.1109/TNET.2018.2865534
Depositing User:	Dr Ken Duffy
Date Deposited:	10 Jan 2022 15:54
Journal or Publication Title:	IEEE/ACM Transactions on Networking
Publisher:	IEE
Refereed:	Yes
URI:	Publisher
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads