MURAL - Maynooth University Research Archive Library

    Optimization-Based Linear Network Coding for General Connections of Continuous Flows

    Cui, Ying and Medard, Muriel and Yeh, Edmund and Leith, Douglas J. and Duffy, Ken R. (2015) Optimization-Based Linear Network Coding for General Connections of Continuous Flows. In: IEEE International Conference on Communications, 8-12 June 2015, London.

    Download (237kB) | Preview
    Official URL:

    Share your research

    Twitter Facebook LinkedIn GooglePlus Email more...

    Add this article to your Mendeley library


    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.

    Item Type: Conference or Workshop Item (Paper)
    Keywords: Optimization-Based; Linear Network Coding; General Connections; Continuous Flows;
    Academic Unit: Faculty of Science and Engineering > Research Institutes > Hamilton Institute
    Item ID: 6214
    Depositing User: Dr Ken Duffy
    Date Deposited: 23 Jun 2015 15:11
    Refereed: Yes

      Repository Staff Only(login required)

      View Item Item control page


      Downloads per month over past year