Iterative max-min fairness algorithms
US9391920B2 · kind B2 · utility
0Cited by
2References
8Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Aug 30, 2012 |
| Grant date | Jul 12, 2016 |
| Priority date | — |
| Expiry date | Nov 20, 2034 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L47/805
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Systems and methods are provided for allocating resources of a network among a plurality of traffic demands to optimize fairness and network utilization. Methods based on flow-increase dynamics converge toward an upward max-min fair (UMMF) allocation, in which the value of each traffic demand cannot be increased, along any of its paths, even if larger traffic demands are removed from the network. An efficient iterative algorithm that converges to a UMMF solution is also provided. The described methods and systems can be implemented efficiently, distributively, and asynchronously.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.