.png){kind=icon}
返回
Network Optimization Problems Subject to Max-Min Fair Flow Allocation
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2013.060513.130351.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a novel way to consider the max-min fairness (MMF) paradigm in traffic engineering. Since MMF appears as a reference model for a fair capacity allocation when the traffic flows are elastic and rates are adapted based on resource availability, we consider it as a requirement due to the way resources are shared by the distributed rate control scheme (like that of the transport protocol), rather than the routing objective. In particular, we define the traffic engineering problem where, given a network topology with link capacities and a set of elastic traffic demands to route, we must select a single path for each demand so as to maximize a network utility function, assuming an MMF bandwidth allocation. We propose a compact mixed-integer linear programming formulation as well as a restricted path formulation. We show with computational experiments that the exact formulation can be solved in a reasonable amount of computing time for medium-size networks and that the restricted path model provides solutions of comparable quality much faster.
Keyword:
Max-min fairness
traffic engineering
bandwidth sharing
utility-based routing
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Development of a copper-graphene nanocomposite based transparent coating with antiviral activity against influenza virus基于铜-石墨烯纳米复合材料的具有抗流感病毒活性的透明涂层的开发.png)
OAAI
IF0
OAAI分享收藏A unified framework for max-min and min-max fairness with applications具有应用程序的max-min和min-max公平性的统一框架
OAAI
OAAI分享收藏 没有更多内容
没有更多内容