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 条
  • [31] An iterative algorithm for the Max-Min knapsack problem with multiple scenarios
    Al-douri, Thekra
    Hifi, Mhand
    Zissimopoulos, Vassilis
    [J]. OPERATIONAL RESEARCH, 2021, 21 (02) : 1355 - 1392
  • [32] New algorithm for the generalized max-min fairness policy based on linear programming
    Moscholios, ID
    Logothetis, MD
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 2005, E88B (02) : 775 - 780
  • [33] A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering
    Danna, Emilie
    Mandal, Subhasree
    Singh, Arjun
    [J]. 2012 PROCEEDINGS IEEE INFOCOM, 2012, : 846 - 854
  • [34] A Resource Management Algorithm Based On Multi-path Max-min Fairness
    Zhang Min
    Wu Chunming
    Jiang Ming
    Yu Jing
    [J]. 2009 FIRST INTERNATIONAL CONFERENCE ON FUTURE INFORMATION NETWORKS, 2009, : 76 - +
  • [35] A dynamic max-min ant system for solving the travelling salesman problem
    Bonyadi, Mohammad Reza
    Shah-Hosseini, Hamed
    [J]. INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2010, 2 (06) : 422 - 433
  • [36] Mobile Network Selection Algorithm based on Max-Min Fairness for Dynamic Weights
    Pornchalermpong, Nonpakit
    Buranapanichkit, Dujdow
    Thongnoo, Krerkchai
    [J]. 2017 14TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING/ELECTRONICS, COMPUTER, TELECOMMUNICATIONS AND INFORMATION TECHNOLOGY (ECTI-CON), 2017, : 549 - 552
  • [37] ε-Fairness:: A trade-off between overhead and max-min fairness
    Bhatnagar, S
    Nath, B
    [J]. 2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5: NEW FRONTIERS IN TELECOMMUNICATIONS, 2003, : 137 - 141
  • [38] General Max-Min Fair Allocation
    Ko, Sheng-Yen
    Chen, Ho-Lin
    Cheng, Siu-Wing
    Hon, Wing-Kai
    Liao, Chung-Shou
    [J]. COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 63 - 75
  • [39] Quantised and Simulated Max-min Fairness in Blockchain Ecosystems
    Metin, Serdar
    Ozturan, Can
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2024, 151 : 260 - 271
  • [40] A max-min fairness and NBS model for bandwidth allocation
    Chen Jing
    Lu Quan
    [J]. ICCSE'2006: PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION: ADVANCED COMPUTER TECHNOLOGY, NEW EDUCATION, 2006, : 742 - 745
12345