.png){kind=icon}
返回
Optimization flow control - I: Basic algorithm and convergence
.png){kind=icon}
OA
AI
DOI：10.1109/90.811451.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using a gradient projection algorithm; In this system, sources select transmission rates that maximize their own benefits, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources' decisions. We allow feedback delays to be different, substantial, and time varying, and links and sources to update at different times and with different frequencies, We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly time-varying environment. We discuss its fairness property.
Keyword:
asynchronous algorithm
congestion pricing
convergence
gradient projection
optimization flow control
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
Some Contributions to the Study of Oenological Lactic Acid Bacteria through Their Interaction with Polyphenols.png)
BeveragesOAAI
BeveragesIF0
OAAI分享收藏Using extended G-code algorithms for networked industrial robotsProceedings of the Fourth International Workshop on Robot Motion and Control (IEEE Cat. No.04EX891)
Proceedings of the Fourth International Workshop on Robot Motion and Control (IEEE Cat. No.04EX891)IF0
PREAI
分享收藏
查看更多内容