首页> 外文会议>Computer performance engineering >A Component-Based Solution Method for Non-ergodic Markov Regenerative Processes
【24h】

A Component-Based Solution Method for Non-ergodic Markov Regenerative Processes

机译:非遍历马尔可夫再生过程的基于组件的求解方法

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

摘要

This paper presents a new technique for the steady state solution of non-ergodic Markov Regenerative Processes (MRP), based on a structural decomposition of the MRP. Each component may either be a CTMC or a (smaller) MRP. Classical steady state solution methods of MRP are based either on the computation of the embedded Markov chain (EMC) denned over regenerative states, leading to high complexity in time and space (since the EMC is usually dense), or on an iterative scheme that does not require the construction of the EMC. The technique presented is particularly suited for MRPs that exhibit a semi-sequential structure. In this paper we present the new algorithm, its asymptotic complexity, and its performance in comparison with classical MRP techniques. Results are very encouraging, even when the MRP only loosely exhibits the required semi-sequential structure.
机译:本文基于MRP的结构分解,提出了一种非遍历马尔可夫再生过程(MRP)稳态求解的新技术。每个组件可以是CTMC或(较小的)MRP。 MRP的经典稳态解决方案方法基于在再生状态下定义的嵌入式马尔可夫链(EMC)的计算,这会导致时间和空间的高度复杂性(因为EMC通常是密集的),或者是基于不需要EMC的构造。提出的技术特别适用于具有半序列结构的MRP。与经典的MRP技术相比,本文介绍了新算法,渐近复杂度及其性能。即使MRP仅宽松地显示所需的半序列结构,结果也令人鼓舞。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号