Fairness in network optimal flow control
Fairness in network optimal flow control
复制标题
网络最优流量控制的公平性
DOI：
10.1109/its.1990.175672
复制
发表时间：
1990
期刊：
影响因子：
--
通讯作者：
C. Douligieris
中科院分区：
文献类型：
--
作者：
R. Mazumdar;L. Mason;C. Douligieris
作者考虑了多类别电信环境中的最优流量控制问题，其中每个用户（或类别）都希望优化其性能，同时对其他用户（类别）“公平”。博弈论中的纳什仲裁方案被证明是公平、最优操作点的合适候选者，因为它满足某些公平公理并且是帕累托最优。该策略可以通过将单个用户性能目标的乘积定义为网络优化标准来实现。这为考虑计算机通信网络文献中所建议的用户权力的乘积提供了基本原理。结果表明，这些点在吞吐量空间中是唯一的，并且还获得了 Jackson 网络中功率和延迟相对于吞吐量的一些凸性属性。<<ETX>>
The authors consider the problem of optimal flow control in a multiclass telecommunications environment where each user (or class) desires to optimize its performance while being 'fair' to the other users (classes). The Nash arbitration scheme from game theory is shown to be a suitable candidate for a fair, optimal operation point in the sense that it satisfies certain axioms of fairness and is Pareto optimal. This strategy can be realized by defining the product of individual user performance objectives as the network optimization criterion. This provides the rationale for considering the product of user powers as has been suggested in the literature of computer communication networks. It is shown that these points are unique in the throughput space, and some convexity properties for power and delays respect to throughputs in a Jackson network are also obtained.<<ETX>>