Optimal Control for Generalized Network-Flow Problems

Optimal Control for Generalized Network-Flow Problems

ID:40382848

大小:1003.04 KB

页数:13页

时间:2019-08-01

Optimal Control for Generalized Network-Flow Problems  _第1页
Optimal Control for Generalized Network-Flow Problems  _第2页
Optimal Control for Generalized Network-Flow Problems  _第3页
Optimal Control for Generalized Network-Flow Problems  _第4页
Optimal Control for Generalized Network-Flow Problems  _第5页
资源描述:

《Optimal Control for Generalized Network-Flow Problems 》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、1OptimalControlforGeneralizedNetwork-FlowProblemsAbhishekSinha,EytanModianoLaboratoryforInformationandDecisionSystems,MassachusettsInstituteofTechnology,Cambridge,MA02139Email:sinhaa@mit.edu,modiano@mit.eduAbstract—Weconsidertheproblemofthroughput-optimalThealgorithmi

2、n[1]iscombinatorialinnatureanddoespacketdissemination,inthepresenceofanarbitrarymixofnothaveawirelesscounterpart,withassociatedinterference-unicast,broadcast,multicastandanycasttraffic,inageneralfreeedgeactivations.FollowingEdmonds’work,avarietywirelessnetwork.Wepropos

3、eanonlinedynamicpolicy,calledofdifferentbroadcastalgorithmshavebeenproposedintheUniversalMax-Weight(UMW),whichsolvestheaboveproblemefficiently.Tothebestofourknowledge,UMWisthefirstliterature,eachonetargetedtooptimizedifferentmetricsthroughput-optimalalgorithmofsuchversa

4、tilityinthecontextsuchasdelay[2],energyconsumption[3]andfault-toleranceofgeneralizednetworkflowproblems.Conceptually,theUMW[4].Inthecontextofoptimizingthroughput,[5]proposespolicyisderivedbyrelaxingtheprecedenceconstraintsassociatedarandomizedbroadcastpolicy,whichisopt

5、imalforwiredwithmulti-hoprouting,andthensolvingamin-costroutingandnetworks.However,extendingthisalgorithmtothewirelessmax-weightschedulingproblemonavirtualnetworkofqueues.Whenspecializedtotheunicastsetting,theUMWpolicyyieldsasettingprovestobedifficult[6].Theauthorsof[7

6、]proposethroughput-optimalcycle-freeroutingandlinkschedulingpolicy.anoptimalbroadcastalgorithmforageneralwirelessnetwork,Thisisincontrasttothewell-knownthroughput-optimalBack-albeitwithexponentialcomplexity.InarecentseriesofpapersPressure(BP)policywhichallowsforpacket

7、cycling,resulting[8][9],asimplethroughput-optimalbroadcastalgorithmhasinexcessivelatency.ExtensivesimulationresultsshowthatthebeenproposedforwirelessnetworkswithanunderlyingDAGproposedUMWpolicyincursasubstantiallysmallerdelayascomparedtotheBPpolicy.Theproofofthroughpu

8、t-optimalitytopology.However,thisalgorithmdoesnotextendtonon-DAGoftheUMWpolicycombinesideasfromstochasticLyapunovnetworks.th

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。