【24h】

Optimal Load Balancing in Insensitive Data Networks

机译:不敏感数据网络中的最佳负载平衡

获取原文
获取原文并翻译 | 示例

摘要

Bonald et al. have recently characterized a set of insensitive dynamic load balancing policies by modelling the system as a Whittle network. In particular, they derived optimal "decentralized" strategies based on limited state information and evaluated their performance in simple example networks. In this paper, we consider the specific case of a data network where each flow can be routed on one of a set of alternative routes. By using the linear programming formulation of MDP theory we are able to analyze optimal routing policies that utilize the full global state information. In the ordinary LP formulation of MDP theory, the global balance condition appears as a linear constraint on the decision variables. In order to retain insensitivity, we impose stricter detailed balance conditions as constraints. As a further extension, the MDP-LP approach allows joint optimization of the routing and resource sharing, in contrast to the earlier work where the resource sharing policy was required to be separately balanced and fixed in advance. The various schemes are compared numerically in a toy network. The advantage given by global state information is in this case negligible, whereas the joint routing and resource sharing gives a clear improvement. The requirement of insensitivity still implies some performance penalty in comparison with the best sensitive policy.
机译:Bonald等。最近,通过将系统建模为Whittle网络,确定了一组不敏感的动态负载平衡策略。特别是,他们基于有限的状态信息得出了最佳的“分散式”策略,并在简单的示例网络中评估了它们的性能。在本文中,我们考虑了数据网络的特定情况,其中每个流都可以在一组替代路由中的一个上进行路由。通过使用MDP理论的线性规划公式,我们能够分析利用全部全局状态信息的最佳路由策略。在MDP理论的普通LP公式中,全局平衡条件表现为对决策变量的线性约束。为了保持不敏感,我们将更严格的详细平衡条件作为约束。作为进一步的扩展,与早期的工作相比,MDP-LP方法允许联合优化路由和资源共享,而在早期的工作中,资源共享策略需要事先进行单独平衡和固定。在玩具网络中对各种方案进行了数值比较。在这种情况下,全局状态信息提供的优势可以忽略不计,而联合路由和资源共享则可以明显改善。与最佳敏感策略相比,不敏感的要求仍然意味着性能下降。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号