• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Approximate Consensus in Stochastic Networks With Application to Load Balancing
【24h】

Approximate Consensus in Stochastic Networks With Application to Load Balancing

机译：随机网络中的近似共识及其在负载均衡中的应用

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper is devoted to the approximate consensus problem for stochastic networks of nonlinear agents with switching topology, noisy, and delayed information about agent states. A local voting protocol with nonvanishing (e.g., constant) step size is examined under time-varying environments of agents. To analyze dynamics of the closed-loop system, the so-called method of averaged models is used. It allows us to reduce analysis complexity of the closed-loop stochastic system. We derive the upper bounds for mean square distance between states of the initial stochastic system and its approximate averaged model. These upper bounds are used to obtain conditions for approximate consensus achievement. An application of general theoretical results to the load balancing problem in stochastic dynamic networks with incomplete information about the current states of agents and with changing set of communication links is considered. The conditions to achieve the optimal level of load balancing are established. The performance of the system is evaluated both analytically and by simulation.
机译：本文致力于非线性拓扑的随机智能网络的近似共识问题，该非线性智能网络具有切换拓扑，噪声和有关代理状态的延迟信息。在代理的时变环境下检查步长不变（例如恒定）的本地投票协议。为了分析闭环系统的动力学，使用了所谓的平均模型方法。它使我们能够降低闭环随机系统的分析复杂性。我们推导了初始随机系统及其近似平均模型之间的均方距离的上限。这些上限用于获得近似达成共识的条件。考虑将一般理论结果应用于随机动态网络中的负载平衡问题，该动态网络具有关于代理的当前状态的不完整信息以及通信链路集的变化。建立达到最佳负载平衡水平的条件。该系统的性能可以通过分析和仿真来评估。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号