Minimum-cost routing with network coding
US7414978B2 · kind B2 · utility
68Cited by
4References
24Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Dec 30, 2004 |
| Grant date | Aug 19, 2008 |
| Priority date | — |
| Expiry date | Sep 10, 2026 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/124
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.