期刊
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS
卷 10, 期 4, 页码 5-17出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/SURV.2008.080403
关键词
Max-min fairness; multi-commodity flow; routing; load-balancing; optimization
资金
- Polish Ministry of Science and Higher Education (MNiSW) [N517397334, 3T11C0057]
- Swedish Research Council [621-2006-5509]
This tutorial is devoted to the notion of Max-Min Fairness (MMF), associated optimization problems, and their applications to multi-commodity flow networks. We first introduce a theoretical background for a generic MMF optimization problem and discuss its relation to lexicographic optimization. We next present resolution algorithms for convex MMF optimization, and analyze their properties. In the second half of the tutorial we discuss its applications to communication networks, in particular to routing and load-balancing. We state several properties with respect to each of the studied problems and analyze the behavior of the algorithms.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据