Max-min fair rate allocation for VCP in multi-bottleneck networks

被引:1
|
作者
Zhang, Huixiang [1 ]
Chen, Chunlei [1 ]
Zhou, Hairui [2 ]
Dai, Guanzhong [1 ]
机构
[1] Northwestern Polytech Univ, Sch Automat, Xian 710072, Peoples R China
[2] China Elect Technol Grp Corp, Inst 28th, Nanjing 210007, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
high bandwidth-delay product networks; congestion control; Variable-structure congestion Control Protocol; VCP; multi-bottleneck networks; max-min fairness;
D O I
10.1504/IJIPT.2014.068251
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Variable-structure congestion Control Protocol (VCP) leverages the existing two Explicit Congestion Notification (ECN) bits for network congestion feedback and achieves comparable performance to eXplicit congestion Control Protocol (XCP). VCP utilises the encoded load factor-based feedback scheme to deliver congestion signals. In multi-bottleneck networks, all bottleneck links on the transmission path would contribute to the aggregate congestion signal, and VCP fails to achieve max-min fairness. To address this problem, a new metric called overload period is introduced to measure the congestion level of links, and the overload period-based feedback scheme is proposed to make sure that each VCP flow's rate is controlled only by the link with minimum overload period encountered on the transmission path. It is proved that the link with minimum overload period is the flow's bottleneck, and the max-min fair rate allocation is achieved in multi-bottleneck networks. The overload period-based feedback scheme is validated using NS2 simulations.
引用
收藏
页码:169 / 180
页数:12
相关论文
共 50 条
  • [1] Can API-RCP Achieve Max-Min Fair Bandwidth Allocation in a Multi-Bottleneck Network?
    Hong, Yang
    Yang, Oliver W. W.
    2009 43RD ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 AND 2, 2009, : 723 - 728
  • [2] Improved VCP: Fast Convergence to Max-Min Fair Bandwidth Allocation
    Zhou, Hairui
    Dai, Guanzhong
    Zhang, Huixiang
    2009 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL I, 2009, : 293 - 296
  • [3] Max-min fair rate allocation in multi-hop wireless ad hoc networks
    Su, Xueyuan
    Chan, Sammy
    2006 IEEE INTERNATIONAL CONFERENCE ON MOBILE ADHOC AND SENSOR SYSTEMS, VOLS 1 AND 2, 2006, : 473 - +
  • [4] Constraint precedence in max-min fair rate allocation
    Tsai, WK
    Iyer, M
    ICC 2000: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3: GLOBAL CONVERGENCE THROUGH COMMUNICATIONS, 2000, : 490 - 494
  • [5] Lexicographic max-min fair rate allocation in random access wireless networks
    Wang, Xin
    Kar, Koushik
    Pang, Jong-Shi
    PROCEEDINGS OF THE 45TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14, 2006, : 1294 - 1300
  • [6] Online Max-min Fair Allocation
    Kawase, Yasushi
    Sumita, Hanna
    ALGORITHMIC GAME THEORY, SAGT 2022, 2022, 13584 : 526 - 543
  • [7] Price-based max-min fair rate allocation in wireless multi-hop networks
    Computer Science Dept., Central China Normal University, Wuhan, China
    不详
    不详
    IEEE Commun Lett, 2006, 1 (31-33):
  • [8] Price-based max-min fair rate allocation in wireless multi-hop networks
    Tan, Liansheng
    Zhang, Xiaomei
    Andrew, Lachlan L. H.
    Zukerman, Moshe
    TENCON 2005 - 2005 IEEE REGION 10 CONFERENCE, VOLS 1-5, 2006, : 1689 - +
  • [9] Price-based max-min fair rate allocation in wireless multi-hop networks
    Tan, LS
    Zhang, XM
    Andrew, LLH
    Chan, S
    Zukerman, M
    IEEE COMMUNICATIONS LETTERS, 2006, 10 (01) : 31 - 33
  • [10] General Max-Min Fair Allocation
    Ko, Sheng-Yen
    Chen, Ho-Lin
    Cheng, Siu-Wing
    Hon, Wing-Kai
    Liao, Chung-Shou
    COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 63 - 75