MaxNet: an efficient max-min fair allocation scheme

被引:0
|
作者
Nguyen, DD
Wang, JD
Andrew, L
Chan, S
机构
关键词
MaxNet; SumNet; max-min fairness; transient networks; performance;
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
It has been analytically proved that both MaxNet and SumNet can achieve max-min fair allocation in static networks. In SumNet networks, such as the TCP algorithm of the current Internet, the source rate is controlled by congestion signal which is the sum of signals from all of the congested links along the path from the source to the destination. In MaxNet networks, only the most congested link generates the control signal to dictate the source rate. This paper investigates the practical aspects of both schemes, specifically, the convergence speed and fairness tracking capability under transient network conditions. We have shown that the stability of SumNet's max-min fairness heavily depends on the network load. Within the stable ranges of operating points, SumNet's max-min fair allocation is obtained at the cost of response speed. An enhanced approach is proposed to improve the stability of SumNet to meet the max-min fairness criterion. We have shown both analytically and by simulation that under stable conditions, MaxNet has faster convergence speed and better fairness tracking capability than SumNet in a highly volatile environment.
引用
收藏
页码:79 / 89
页数:11
相关论文
共 50 条
  • [1] Online Max-min Fair Allocation
    Kawase, Yasushi
    Sumita, Hanna
    [J]. ALGORITHMIC GAME THEORY, SAGT 2022, 2022, 13584 : 526 - 543
  • [2] 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
  • [3] Asymptotic optimality of the max-min fair allocation
    Ye, Heng-Qing
    Yao, David D.
    [J]. WODES 2006: EIGHTH INTERNATIONAL WORKSHOP ON DISCRETE EVENT SYSTEMS, PROCEEDINGS, 2006, : 352 - +
  • [4] On efficient max-min fair routing algorithms
    Pióro, M
    Nilsson, P
    Kubilinskas, E
    Fodor, G
    [J]. EIGHTH IEEE INTERNATIONAL SYMPOSIUM ON COMPUTERS AND COMMUNICATION, VOLS I AND II, PROCEEDINGS, 2003, : 365 - 372
  • [5] On (1, ε)-Restricted Max-Min Fair Allocation Problem
    Chan, T. -H. Hubert
    Tang, Zhihao Gavin
    Wu, Xiaowei
    [J]. ALGORITHMICA, 2018, 80 (07) : 2181 - 2200
  • [6] On the Max-Min Fair Stochastic Allocation of Indivisible Goods
    Kawase, Yasushi
    Sumita, Hanna
    [J]. THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 2070 - 2078
  • [7] Max-min fair allocation for resources with hybrid divisibilities
    Li, Yunpeng
    He, Changjie
    Jiang, Yichuan
    Wu, Weiwei
    Jiang, Jiuchuan
    Zhang, Wei
    Fan, Hui
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2019, 124 : 325 - 340
  • [8] Combinatorial Algorithm for Restricted Max-Min Fair Allocation
    Annamalai, Chidambaram
    Kalaitzis, Christos
    Svensson, Ola
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2017, 13 (03)
  • [9] Constraint precedence in max-min fair rate allocation
    Tsai, WK
    Iyer, M
    [J]. ICC 2000: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3: GLOBAL CONVERGENCE THROUGH COMMUNICATIONS, 2000, : 490 - 494
  • [10] Spatio-temporal max-min fair rate allocation
    Tsai, WK
    Iyer, M
    [J]. ICC 2000: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3: GLOBAL CONVERGENCE THROUGH COMMUNICATIONS, 2000, : 480 - 484