Abstract
A method and computer program product for performing minimum cost routing with network coding is presented. The method and system model a network as a directed graph. A cost per unit flow is associated with each link of the directed graph. A link capacity is associated with each link of the directed graph. A network code is then computed that sets up a routing connection that achieves an optimal cost using the cost per unit flow for each link of the directed graph and using the link capacity for each link of the directed graph.
| Original language | English (US) |
|---|---|
| U.S. patent number | 7414978 |
| Filing date | 12/30/04 |
| State | Published - Aug 19 2008 |