The node-centric formulation for network utility maximization of multihop wireless networks with elastic and inelastic traffic

P. L. Vo, M. Siddiqui, C. Hong
{"title":"The node-centric formulation for network utility maximization of multihop wireless networks with elastic and inelastic traffic","authors":"P. L. Vo, M. Siddiqui, C. Hong","doi":"10.1109/INM.2011.5990517","DOIUrl":null,"url":null,"abstract":"We consider a network with two kinds of traffic: inelastic and elastic. The inelastic traffic requires fixed throughput and high priority, while the elastic traffic has the rate that can be controlled and low priority. Given the fixed rate of inelastic traffic, the problem of how to inject the elastic traffic into the network to achieve the maximum utility of elastic traffic is solved in this paper. The node-centric formulation in cross-layer design framework is applied. By using Lagrange duality method, the congestion control, back-pressure routing and Max-weight scheduling are integrated naturally when decomposing the Larangian. The Greedy Distributed scheduling is introduced to not only decentralize scheduling, but also decrease the complexity of the Max-weight scheduling. The Back-pressure routing has presented the poor performance at the light load, the packets take an unnecessary long route from the source node to the destination node. As the result, the delay is excessively large at light load. The enhancement algorithm is implemented to maximize the utility while minimizing the resource usage. An admission control scheme is also introduced to check if the new inelastic flow is admissible.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INM.2011.5990517","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We consider a network with two kinds of traffic: inelastic and elastic. The inelastic traffic requires fixed throughput and high priority, while the elastic traffic has the rate that can be controlled and low priority. Given the fixed rate of inelastic traffic, the problem of how to inject the elastic traffic into the network to achieve the maximum utility of elastic traffic is solved in this paper. The node-centric formulation in cross-layer design framework is applied. By using Lagrange duality method, the congestion control, back-pressure routing and Max-weight scheduling are integrated naturally when decomposing the Larangian. The Greedy Distributed scheduling is introduced to not only decentralize scheduling, but also decrease the complexity of the Max-weight scheduling. The Back-pressure routing has presented the poor performance at the light load, the packets take an unnecessary long route from the source node to the destination node. As the result, the delay is excessively large at light load. The enhancement algorithm is implemented to maximize the utility while minimizing the resource usage. An admission control scheme is also introduced to check if the new inelastic flow is admissible.
弹性和非弹性多跳无线网络中网络效用最大化的节点中心公式
我们考虑一个有两种流量的网络:非弹性流量和弹性流量。非弹性流量要求固定的吞吐量和高优先级;弹性流量要求速率可控制,优先级低。在非弹性流量率固定的情况下,解决了如何将弹性流量注入到网络中,使弹性流量发挥最大效用的问题。采用了跨层设计框架中的节点中心公式。利用拉格朗日对偶方法,在分解Larangian时将拥塞控制、背压路由和最大权调度自然地结合在一起。引入贪心分布式调度不仅可以分散调度,而且可以降低最大权调度的复杂度。背压路由在负载较轻时表现出较差的性能,数据包从源节点到目的节点需要经过不必要的长距离路由。因此,在轻载情况下,延迟过大。在实现增强算法的同时,实现了最大的效用,同时最小化了资源的使用。引入了一种允许控制方案来检查新的非弹性流是否允许。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信