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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE/ACM transactions on networking Vol. 15; no. 5; pp. 1073 - 1083
Main Authors:	Radunovic, B., Le Boudec, J.-Y.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.10.2007 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!