Invention Grant
- Patent Title: Iterative max-min fairness algorithms
- Patent Title (中): 迭代最大最小公平算法
-
Application No.: US13599958Application Date: 2012-08-30
-
Publication No.: US09391920B2Publication Date: 2016-07-12
- Inventor: Avinatan Hassidim , Emilie Jeanne Anne Danna , Alok Kumar , Dan Raz , Michal Segalov
- Applicant: Avinatan Hassidim , Emilie Jeanne Anne Danna , Alok Kumar , Dan Raz , Michal Segalov
- Applicant Address: US CA Mountain View
- Assignee: Google Inc.
- Current Assignee: Google Inc.
- Current Assignee Address: US CA Mountain View
- Agency: Foley & Lardner LLP
- Agent John D. Lanza
- Priority: IL216313 20111110
- Main IPC: H04L12/911
- IPC: H04L12/911 ; H04L12/923 ; H04L12/927 ; H04L12/24 ; H04L12/801 ; H04W72/02 ; H04W72/06

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.
Public/Granted literature
- US20130121146A1 ITERATIVE MAX-MIN FAIRNESS ALGORITHMS Public/Granted day:2013-05-16
Information query