See this document in CiteSeerX!

Fairness in Non-convex Systems (2005)  (Make Corrections)  
Corinne Touati, Hisao Kameda, Atsushi Inoie



  Home/Search   Context   Related

 
View or download:
osdp.is.tsukuba.ac.jp/~co...CSTR054.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  osdp.is.tsukuba.ac.jp/~cor...pubs (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In general, the set of users utilities is bounded because of the limitation of resources. There may exist many Pareto optimal points in the set of users utilities. For selecting a Pareto optimum point, a family of fairness criteria, that contains the max-min fairness and a parameterized family of fairness (by Mo and Walrand), has been proposed and examined in some concrete networking contexts that result in specific convex utility sets. We newly examine general compact (closed and bounded)... (Update)

Active bibliography (related documents):   More   All
0.6:   Pareto Set, Fairness, and Nash Equilibrium: A Case Study.. - Inoie, Kameda, Touati   (Correct)
0.4:   Generalized Nash Bargaining Solution for Bandwidth Allocation - Touati, Altman, Galtier (2006)   (Correct)
0.4:   A Survey on Networking Games in Telecommunications - Altman, Boulogne.. (2003)   (Correct)

Similar documents based on text:
5.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ touati-fairness,
  author = "Corinne Touati and Hisao Kameda and Atsushi Inoie",
  title = "Fairness in Non-convex Systems",
  url = "citeseer.ist.psu.edu/touati05fairness.html" }
Citations (may not include all citations):
463   Rate control in communication networks: Shadow prices - Maulloo, Kelly et al. - 1998
195   Charging and rate control for elastic traffic - Kelly - 1997
151   Data Networks (context) - Bertsekas, Gallager - 1992
101   Fair end-to-end window-based congestion control - Mo, Walrand - 2000
95   The Bargaining Problem (context) - Nash - 1950
42   Impact of fairness on internet performance - Bonald, Massouli - 2001
42   A game theoretic framework for bandwidth allocation and pric.. (context) - che, Mazumdar et al. - 2000
35   Optimal static load balancing in distributed computer system.. (context) - Tantawi, Towsley - 1985
23   Optimal Load Balancing in Distributed Computer Systems (context) - Kameda, Li et al. - 1997
22   Understanding TCP Vegas: a duality model - Low, Peterson et al. - 2001
22   Fairness in network optimal flow control: Optimality of prod.. (context) - Mazumdar, Mason et al. - 1991
20   Bandwidth sharing: objectives and algorithms - Massouli, Roberts - 1999
13   Braess-like paradoxes in distributed computer systems - Kameda, Altman et al. - 2000
10   Load balancing problems for multiclass jobs in distributed/p.. (context) - Li, Kameda - 1998
7   An algorithm for optimal static load balancing in distribute.. (context) - Kim, Kameda - 1990
5   On fairness in bandwidth allocation (context) - Touati, Altman et al. - 2001
3   Utility Based Fair Bandwidth Allocation - Touati, Altman et al. - 2002
1   Alternative characterizations of three bargaining solutions .. (context) - Xu, Yoshihara - 2005
1   An Extension of the Nash Bargaining Solution to Nonconvex Pr.. (context) - Conley, Wilkie - 1996
1   On Fairness in Distributed Job Scheduling Across Multiple Si.. (context) - Sabin, Sahasrabudhe et al. - 2004
1   Mathematical Analysis (context) - Zakon - 2004

Documents on the same site (http://www.osdp.is.tsukuba.ac.jp/~corinne/pubs.html):   More
Generalized Nash Bargaining Solution for Bandwidth Allocation - Touati, Altman, Galtier (2006)   (Correct)
Unknown - Www   (Correct)
Semi-Definite Programming for Bandwidth Allocation in.. - Touati, Altman, Galtier (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC