A Unified Framework for Max-Min and Min-Max Fairness With Applications

Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing it; in most, but not all cases, they are based on the notion of bottlenecks. In spite of this wide applicability, there are still...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE/ACM transactions on networking Ročník 15; číslo 5; s. 1073 - 1083
Hlavní autoři:	Radunovic, B., Le Boudec, J.-Y.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.10.2007 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Allocations Best-effort traffic Complexity Computation Design optimization Distributed algorithms Distributed computing elastic traffic Filling Linear programming Mathematical programming mathematical programming/optimization max-min fairness Networks Peer to peer computing Programming Proving Resource management Studies system design Telecommunication traffic Water
ISSN:	1063-6692, 1558-2566
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!