贴现率效用最大化(DRUM):延迟敏感的公平资源分配框架

A. Eryilmaz, Irem Koprulu
{"title":"贴现率效用最大化(DRUM):延迟敏感的公平资源分配框架","authors":"A. Eryilmaz, Irem Koprulu","doi":"10.23919/WIOPT.2017.7959921","DOIUrl":null,"url":null,"abstract":"We introduce a new optimization framework, built over a discounted-rate metric, that captures the sensitivities of wireless users to time-variations in their fairness measure of rate allocations. The resulting, so-called, Discounted-Rate Utility Maximization (DRUM) formulation not only accommodates traditional long-term and less-explored instant fairness concepts in its extremes, but also encompasses all intermediate degrees of sensitivity to fluctuations in the users' rate allocations. After introducing the versatile DRUM formulation, we fully characterize its solution in the instantly-fair and long-term-fair extremes for the general class of ω-weighted α-fair utility functions. These solutions reveal the non-trivial impact of fading channel statistics and the utility function parameters on the rate allocations, even under perfectly symmetric network conditions. In particular, we demonstrate that the rate allocations lie between the maximum and the harmonic mean of the fading-channel rates. To achieve rates in-between these extremes, we also address the general solution of DRUM by proposing a novel low-complexity dynamic rate allocation algorithm that does not require the knowledge of the channel statistics. This algorithm is proven to achieve the optimal performance of the instantly-fair and long-term-fair solutions as the discount parameter approaches its lower and upper limits, respectively. We also study the fairness and rate allocation characteristics of our algorithm for intermediate values of the discount parameter in a Rayleigh-Fading environment.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"28 1","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Discounted-rate utility maximization (DRUM): A framework for delay-sensitive fair resource allocation\",\"authors\":\"A. Eryilmaz, Irem Koprulu\",\"doi\":\"10.23919/WIOPT.2017.7959921\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a new optimization framework, built over a discounted-rate metric, that captures the sensitivities of wireless users to time-variations in their fairness measure of rate allocations. The resulting, so-called, Discounted-Rate Utility Maximization (DRUM) formulation not only accommodates traditional long-term and less-explored instant fairness concepts in its extremes, but also encompasses all intermediate degrees of sensitivity to fluctuations in the users' rate allocations. After introducing the versatile DRUM formulation, we fully characterize its solution in the instantly-fair and long-term-fair extremes for the general class of ω-weighted α-fair utility functions. These solutions reveal the non-trivial impact of fading channel statistics and the utility function parameters on the rate allocations, even under perfectly symmetric network conditions. In particular, we demonstrate that the rate allocations lie between the maximum and the harmonic mean of the fading-channel rates. To achieve rates in-between these extremes, we also address the general solution of DRUM by proposing a novel low-complexity dynamic rate allocation algorithm that does not require the knowledge of the channel statistics. This algorithm is proven to achieve the optimal performance of the instantly-fair and long-term-fair solutions as the discount parameter approaches its lower and upper limits, respectively. We also study the fairness and rate allocation characteristics of our algorithm for intermediate values of the discount parameter in a Rayleigh-Fading environment.\",\"PeriodicalId\":6630,\"journal\":{\"name\":\"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"volume\":\"28 1\",\"pages\":\"1-8\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/WIOPT.2017.7959921\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WIOPT.2017.7959921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

我们引入了一个新的优化框架,建立在一个折现率指标,捕捉无线用户对时间变化的敏感性,在他们的公平衡量速率分配。由此产生的所谓折现率效用最大化(DRUM)公式不仅容纳了传统的长期和较少探索的即时公平概念的极端情况,而且还包含了对用户费率分配波动的所有中间敏感程度。在介绍了通用的DRUM公式后,我们在ω-加权α-公平效用函数的一般类别的即时公平和长期公平极值中充分表征了其解决方案。这些解决方案揭示了即使在完全对称的网络条件下,衰落信道统计数据和效用函数参数对速率分配的重要影响。特别地,我们证明了速率分配介于衰减信道速率的最大值和谐波平均值之间。为了实现介于这两个极端之间的速率,我们还通过提出一种新的低复杂度动态速率分配算法来解决DRUM的一般解决方案,该算法不需要了解信道统计信息。当贴现参数分别接近其下限和上限时,该算法实现了即时公平解和长期公平解的最优性能。在瑞利衰落环境下,我们还研究了该算法对折扣参数中间值的公平性和速率分配特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Discounted-rate utility maximization (DRUM): A framework for delay-sensitive fair resource allocation
We introduce a new optimization framework, built over a discounted-rate metric, that captures the sensitivities of wireless users to time-variations in their fairness measure of rate allocations. The resulting, so-called, Discounted-Rate Utility Maximization (DRUM) formulation not only accommodates traditional long-term and less-explored instant fairness concepts in its extremes, but also encompasses all intermediate degrees of sensitivity to fluctuations in the users' rate allocations. After introducing the versatile DRUM formulation, we fully characterize its solution in the instantly-fair and long-term-fair extremes for the general class of ω-weighted α-fair utility functions. These solutions reveal the non-trivial impact of fading channel statistics and the utility function parameters on the rate allocations, even under perfectly symmetric network conditions. In particular, we demonstrate that the rate allocations lie between the maximum and the harmonic mean of the fading-channel rates. To achieve rates in-between these extremes, we also address the general solution of DRUM by proposing a novel low-complexity dynamic rate allocation algorithm that does not require the knowledge of the channel statistics. This algorithm is proven to achieve the optimal performance of the instantly-fair and long-term-fair solutions as the discount parameter approaches its lower and upper limits, respectively. We also study the fairness and rate allocation characteristics of our algorithm for intermediate values of the discount parameter in a Rayleigh-Fading environment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信