首页> 外文期刊>Computer Communications >Stochastic resource scheduling via bilayer dynamic Markov decision process in mobile cloud networks
【24h】

Stochastic resource scheduling via bilayer dynamic Markov decision process in mobile cloud networks

机译:移动云网络中基于双层动态马尔可夫决策过程的随机资源调度

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

In mobile cloud networks, the efficiency and the quality of service are mainly affected by the service delay, the drop rate of service requests and CPU utilization. For these reasons, we propose a real-time stochastic resource scheduling framework (R-SRSF) to realize pre-allocation of resources by bilayer dynamic markov decision processes (DMDPs). In R-SRSF, we divide the resource scheduling into two parts, the virtual machine (VM) basic configuration resources management and VM switching management. To this end, we firstly design a strategy transformation management algorithm (STMA) to control the VM basic configuration resources. Secondly, we design a scheme-changed drift-plus-penalty algorithm (SDPPA) to execute VM switching management. We also prove the convergence of SDPPA based on Lyapunov optimization theory. For better VM scheduling, we propose a stochastic dynamic policy adjustment algorithm to cooperate with SDPPA. The experimental results show that R-SRSF can reduce the service delay, expenditure and the drop rate of service requests. Moreover, R-SFISF also has a high CPU utilization and stability.
机译:在移动云网络中,服务效率和服务质量主要受服务延迟,服务请求的丢弃率和CPU利用率的影响。由于这些原因,我们提出了一种实时随机资源调度框架(R-SRSF),以通过双层动态马尔可夫决策过程(DMDP)实现资源的预分配。在R-SRSF中,我们将资源调度分为两部分,虚拟机(VM)基本配置资源管理和VM切换管理。为此,我们首先设计了一种策略转换管理算法(STMA)来控制虚拟机的基本配置资源。其次,我们设计了一种方案更改的漂移加惩罚算法(SDPPA)来执行VM切换管理。我们还基于李雅普诺夫优化理论证明了SDPPA的收敛性。为了更好地进行VM调度,我们提出了一种与SDPPA配合使用的随机动态策略调整算法。实验结果表明,R-SRSF可以减少服务延迟,减少支出和减少服务请求。而且,R-SFISF还具有很高的CPU利用率和稳定性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号