Iterative max-min fairness algorithms

A. Hassidim; E. J. A. Danna; A. Kumar; D. Raz; M. Segalov

Iterative max-min fairness algorithms

A. Hassidim (Inventor), E. J. A. Danna (Inventor), A. Kumar (Inventor), D. Raz (Inventor), M. Segalov (Inventor)

CS@BIU

Research output: Patent

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.

Original language	English
Patent number	US9391920B2
State	Published - 2016

Cite this

@misc{28338580995c456a890e38fdfb4dc26e,

title = "Iterative max-min fairness algorithms",

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.",

author = "A. Hassidim and Danna, {E. J. A.} and A. Kumar and D. Raz and M. Segalov",

year = "2016",

language = "אנגלית",

type = "Patent",

note = "US9391920B2",

}

TY - PAT

T1 - Iterative max-min fairness algorithms

AU - Hassidim, A.

AU - Danna, E. J. A.

AU - Kumar, A.

AU - Raz, D.

AU - Segalov, M.

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - https://patents.google.com/patent/US9391920B2/en

M3 - ???researchoutput.researchoutputtypes.patent.patent???

M1 - US9391920B2

ER -

Iterative max-min fairness algorithms

Abstract

Other files and links

Cite this