Lexicographic Max-Min Fair Rate Allocation in Random Access Wireless Networks
Lexicographic Max-Min Fair Rate Allocation in Random Access Wireless Networks
复制标题
随机接入无线网络中字典式最大-最小公平速率分配
DOI：
10.1109/cdc.2006.377233
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
J. Pang
中科院分区：
文献类型：
--
作者：
Xin Wang;K. Kar;J. Pang
我们考虑随机接入无线网络中链路层的字典式最大-最小公平速率控制问题。在字典最大最小公平速率分配中，网络中的最小链路速率以字典顺序被最大化。对于Aloha多址接入模型，我们提出了迭代的方法，在非常一般的假设下，网络拓扑结构和通信模式，达到最佳速率的方法也适合分布式实现。本文的方法和结果推广了X. Wang和K. Kar（2004）关于最大化随机接入网络中的最小链路速率的研究，并很好地连接到D. Bertsekas和R. 03 The Dog（1992）
We consider the lexicographic max-min fair rate control problem at the link layer in a random access wireless network. In the lexicographic max-min fair rate allocation, the minimum link rates in the network are maximized in a lexicographic order. For the Aloha multiple access model, we propose iterative approaches that attain optimal rates under very general assumptions on the network topology and communication pattern; the approaches are also amenable to a distributed implementation. The approach and result in this paper generalize those in the work of X. Wang and K. Kar (2004) on maximizing the minimum link rate in a random access network, and nicely connect to the "bottleneck-based" lexicographic max-min rate optimization algorithm popularly used in wired networks by D. Bertsekas and R. Gallagher (1992)