Results 1 - 10 of 3,555

Fair end-to-end window-based congestion control

by Jeonghoon Mo, Jean Walrand - IEEE/ACM TRANS. ON NETWORKING , 2000
"... In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packetswitched networks with first come-first served routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. T ..."
Abstract - Cited by 676 (3 self) - Add to MetaCart
In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packetswitched networks with first come-first served routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness

An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision

by Yuri Boykov, Vladimir Kolmogorov - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2001
"... After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut/max-flow algorithms with different polynomial time compl ..."
Abstract - Cited by 1315 (53 self) - Add to MetaCart
After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut/max-flow algorithms with different polynomial time

Round-Robin Scheduling for Max-Min Fairness in Data Networks

by Ellen L. Hahne - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 9. NO. 7. SEPTEMBER 1991 , 1991
"... This paper studies a simple strategy, proposed independently by Gallager [l] and Katevenis [2], for fairly allocating link capacity in a point-to-point packet network with virtual circuit routing. Each link offers its packet transmission slots to its user sessions by polling them in round-robin orde ..."
Abstract - Cited by 132 (0 self) - Add to MetaCart
-robin order. In addition, window flow control is used to prevent excessive packet queues at the network nodes. As the window size increases, the session throughput rates are shown to approach limits that are perfectly fair in the max-min sense. That is, the smallest session rate in the network is as large

An Approximation Algorithm for Max-Min Fair Allocation of Indivisible goods

by Arash Asadpour, Amin Saberi - In Proc. of the ACM Symposium on Theory of Computing (STOC
"... In this paper, we give the first approximation algorithm for the problem of max-min fair allocation of indivisible goods. An instance of this problem consists of a set of k people and m indivisible goods. Each person has a known linear utility function over the set of goods which might be different ..."
Abstract - Cited by 59 (2 self) - Add to MetaCart
In this paper, we give the first approximation algorithm for the problem of max-min fair allocation of indivisible goods. An instance of this problem consists of a set of k people and m indivisible goods. Each person has a known linear utility function over the set of goods which might be different

Low-complexity distributed fair scheduling for wireless multi-hop networks

by Aleksi Penttinen, Iordanis Koutsopoulos, Ros Tassiulas
"... Abstract — Max-min fair bandwidth allocation is a meaningful objective whenever the level of user satisfaction cannot be clearly expressed as a function of the allocated bandwidth. In this work, we address the issue of approximating max-min fairness in a wireless network without the requirement for ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
Abstract — Max-min fair bandwidth allocation is a meaningful objective whenever the level of user satisfaction cannot be clearly expressed as a function of the allocated bandwidth. In this work, we address the issue of approximating max-min fairness in a wireless network without the requirement

Low-State Fairness: Lower Bounds and Practical Enforcement

by Abhimanyu Das, Debojyoti Dutta, Ashish Goel, John Heidemann, Ahmed Helmy
"... Abstract — Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the space complexity of fairness algorithms, and the communication complexity of distributed global fairness algorithm ..."
Abstract - Add to MetaCart
Abstract — Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the space complexity of fairness algorithms, and the communication complexity of distributed global fairness

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

by Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson , 2014
"... We study the basic allocation problem of assigning resources to players so as to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a certain configuration-LP can be used to estima ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
We study the basic allocation problem of assigning resources to players so as to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a certain configuration-LP can be used

An Approximate Calculation of Max-Min Fair Throughputs for Non-Persistent Elastic Flows

by Pinaki Shankar Chanda, Anurag Kumar, Arzad Alam Kherani , 2001
"... The general problem we consider is the analysis of a model in which there are several routes in a network, on each route elastic flows arrive randomly according to some arrival process, and each flow transfers a finite volume of data sampled from some distribution. We are interested in computing a ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
distributed. At each instant the network shares the band-width among the ongoing flows according to the max-min fair bandwidth sharing mechanism, i.e., Instantaneous Max-Min Fair (IMMF) sharing. The measure of performance we consider is the time average bandwidth obtained by flows on each route. We pro-pose a

Charging and rate control for elastic traffic

by Frank Kelly - European Transactions on Telecommunications , 1997
"... This paper addresses the issues of charging, rate control and routing for a communication network carrying elastic traffic, such as an ATM network offering an available bit rate service. A model is described from which max–min fairness of rates emerges as a limiting special case; more generally, the ..."
Abstract - Cited by 936 (7 self) - Add to MetaCart
This paper addresses the issues of charging, rate control and routing for a communication network carrying elastic traffic, such as an ATM network offering an available bit rate service. A model is described from which max–min fairness of rates emerges as a limiting special case; more generally

Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

by Tom Leighton, Satish Rao - J. ACM , 1999
"... In this paper, we establish max-flow min-cut theorems for several important classes of multicommodity flow problems. In particular, we show that for any n-node multicommodity flow problem with uniform demands, the max-flow for the problem is within an O(log n) factor of the upper bound implied by ..."
Abstract - Cited by 357 (6 self) - Add to MetaCart
by the min-cut. The result (which is existentially optimal) establishes an important analogue of the famous 1-commodity max-flow min-cut theorem for problems with multiple commodities. The result also has substantial applications to the field of approximation algorithms. For example, we use the flow result
Results 1 - 10 of 3,555