A polynomial algorithm for solving a general max-min fairness problem

被引：13
|
作者：
Tomaszewski, A [1 ]
机构：
[1] Warsaw Univ Technol, Inst Telecommun, PL-00665 Warsaw, Poland
来源：
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS | 2005年 / 16卷 / 03期
关键词：
D O I：
10.1002/ett.1047
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
An iterative algorithm of polynomial complexity is presented that solves a max-min fairness problem which is often encountered while dealing with traffic routing or capacity allocation problems. The algorithm does not depend on any specific traffic routing problem formulation and is sufficiently general to be applied to a broad class of traffic routing and capacity allocation problems. The correctness of the algorithm and its complexity are formally proved. Copyright (c) 2005 AElT.
引用
收藏
页码：233 / 240
页数：8
相关论文
共 50 条
  • [1] An approximation algorithm for the general max-min resource sharing problem
    Jansen, K
    [J]. MATHEMATICAL PROGRAMMING, 2006, 106 (03) : 547 - 566
  • [2] An approximation algorithm for the general max-min resource sharing problem
    Klaus Jansen
    [J]. Mathematical Programming, 2006, 106 : 547 - 566
  • [3] Upward Max-Min Fairness
    Danna, Emilie
    Hassidim, Avinatan
    Kaplan, Haim
    Kumar, Alok
    Mansour, Yishay
    Raz, Danny
    Segalov, Michal
    [J]. JOURNAL OF THE ACM, 2017, 64 (01) : 1 - 24
  • [4] Polynomial-time Combinatorial Algorithm for General Max-Min Fair Allocation
    Ko, Sheng-Yen
    Chen, Ho-Lin
    Cheng, Siu-Wing
    Hon, Wing-Kai
    Liao, Chung-Shou
    [J]. ALGORITHMICA, 2024, 86 (02) : 485 - 504
  • [5] Multicast-favorable max-min fairness -: A general definition of multicast fairness
    Zhang, TT
    Österberg, P
    Xu, YZ
    [J]. DFMA '05: FIRST INTERNATIONAL CONFERENCE ON DISTRIBUTED FRAMEWORKS FOR MULTIMEDIA APPLICATIONS, PROCEEDINGS, 2004, : 239 - 244
  • [6] A distributed algorithm for weighted max-min fairness in MPLS networks
    Skivée, F
    Leduc, G
    [J]. TELECOMMUICATIONS AND NETWORKING - ICT 2004, 2004, 3124 : 644 - 653
  • [7] A MAX-MIN PROBLEM
    MARSH, DCB
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1967, 74 (1P1): : 86 - &
  • [8] Priority service and max-min fairness
    Marbach, P
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (05) : 733 - 746
  • [9] Priority service and max-min fairness
    Marbach, P
    [J]. IEEE INFOCOM 2002: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2002, : 266 - 275
  • [10] A polynomial-time algorithm for max-min partitioning of ladders
    Becker, R
    Lari, I
    Lucertini, M
    Simeone, B
    [J]. THEORY OF COMPUTING SYSTEMS, 2001, 34 (04) : 353 - 374
12345