Reward model solution methods with impulse and rate rewards: an algorithm and numerical results

Reward models have become an important method for specifying performability models for many types of systems. Many methods have been proposed for solving reward models, but no method has proven itself to be applicable over all system classes and sizes. Furthermore, specification of reward models has usually been done at the state level, which can be extremely cumbersome for realistic models. We describe a method to specify reward models as stochastic activity networks (SANs) with impulse and rate rewards, and a method by which to solve these models via uniformization. The method is an extension of one proposed by de Souza e Silva and Gail in which impulse and rate rewards are specified at the SAN level, and solved in a single model. Furthermore, we propose a new technique for discarding paths in the uniformized process whose contribution to the reward variable is minimal, which greatly reduces the time and space required for a solution. A bound is calculated on the error introduced by this discarding, and its effectiveness is illustrated through the study of the performability and availability of a degradable multi-processor system.     

On Markov reward modelling with FSPNs

In this paper, fluid stochastic Petri nets (FSPNs) will be used for modelling reward in a performability model. Two variations of a known performability model are presented in order to demonstrate the ability of FSPNs in modelling accumulated rate reward as well as accumulated impulse reward. In the first model two fluid places are used, one of which represents the profit (reward) obtained by operating the system and the other one the buffer that is approximated continuously. In the second model only one fluid place is used, representing the costs (negative reward) arising due to repair of system components. The costs increase continuously at deterministic rate while the system is in state of repair (which is a rate reward in the model). Additional costs incur each time the buffer fails (which is an impulse reward in the model). With a numerical solution algorithm the distribution of the reward and its mean are computed. The accuracy of the numerical algorithm is studied by showing for the first model the impact of the choice of the discretization stepsizes on the obtained solution. Different boundary conditions are discussed for the second model.     

基于Linux的RHEL集群虚拟化系统的研究

通过对现有服务器集群系统的虚拟化系统和集群系统进行分析,采用虚拟化和Linux技术将虚拟化、负载均衡集群和高可用集群整合在一起,实现了三层构架的WWW服务器集群,从而以较低的价格达到了昂贵的商业硬件存储解决方案所实现的效果,从而有效克服现有集群技术的缺点。     

基于TimeMark技术的网络级数据容灾设计与实施

建立存储虚拟化的网络级容灾系统,要注意数据的不一致或不完整的问题,因为由此可能导致系统无法启动或恢复。利用TimeMark技术建立容灾系统,存储设备可以为数据副本生成多个快照,记录数据副本在不同时刻的状态,可以有效地避免渐变式灾难带来的数据损坏,从而保障数据一致性和可用性。     

支持多生产中心的远程容灾系统的设计与实现

该文设计并实现了一种支持多生产中心的远程容灾系统。系统在本地服务器端的设备驱动层实时监控写操作,通过Internet将数据传送到远程备份中心,并存入数据库中实现备份。该系统无需企业自建灾备中心,并且利用Internet这一廉价资源,可以最大限度地降低企业容灾预算。此外,该系统还提供了基于B/S架构的配置管理方式。     

基于VMware的高校数据中心应用研究

随着高校信息化发展进程的加快,各种应用系统层出不穷,必然导致硬件设备不断的增加,同时也出现了数据中心管理复杂、资源的严重浪费、数据备份困难等问题.本文以北京外国语大学的数据中心为例,探索并分析了VMware虚拟化技术,并在此基础上作出了总结和展望.     

一种基于ESXi的虚拟机备份与恢复系统

设计并实现了一种基于ESXi的虚拟机备份与恢复系统。通过远程抓取虚拟机变化的数据块,并将其备份到备份服务器来实现灾难冬份,通过将备份数据写回到远程虚拟机来实现灾难恢复。系统只需部署于备份服务器,便可快速高效地备份虚拟机。并不会增加虚拟机的额外负载;提供Web服务器可使用户远程控制备份恢复任务;支持多种备份与恢复策略。     

Fluid Stochastic Petri Nets Augmented with Flush-out Arcs: Modelling and Analysis

Fluid(or Hybrid) Petri Nets are Petri net based models with two classesof places: discrete places that carry a natural number of distinctobjects (tokens), and fluid places that hold a positive amountof fluid, represented by a real number. With respect to previousformulations, the FSPN model presented in this paper, is augmentedwith a new primitive, called flush-out arc. A flush-out arc connectsa fluid place to a timed transition, and has the effect of instantaneouslyemptying the fluid place when the transition fires. The paperdiscusses the modeling power of the augmented formalism, andshows how the dynamics of the underlying stochastic process canbe analytically described by a set of integro-differential equations.A procedure is presented to automatically derive the solutionequations from the model specifications. The whole methodologyis illustrated by means of various examples.     

Heuristics based server consolidation with residual resource defragmentation in cloud data centers

Server Consolidation is one of the foremost concerns associated with the effective management of a Cloud Data Center as it has the potential to accomplish significant reduction in the overall cost and energy consumption. Most of the existing works on Server Consolidation have focused only on reducing the number of active physical servers (PMs) using Virtual Machine (VM) Live Migration. But, along with reducing the number of active PMs, if a consolidation approach reduces residual resource fragmentation, the residual resources can be efficiently used for new VM allocations, or VM reallocations, and some future migrations can also be reduced. None of the existing works have explicitly focused on reducing residual resource fragmentation along with reducing the number of active PMs to the best of our knowledge. We propose RFAware Server Consolidation, a heuristics based server consolidation approach which performs residual resource defragmentation along with reducing the number of active PMs in cloud data centers.     

异构云平台中能源有效的虚拟机部署研究

能源消耗已经成为数据中心操作成本的重要组成部分,虚拟化技术是降低数据中心能源消耗的有效方法之一.为了降低数据中心过高的能源消耗,利用虚拟化技术,结合数据中心中物理机的异构性和虚拟机所需资源的多维性,提出了一个衡量不同类型物理机性能的模型和一个衡量多维资源利用率的模型,在此基础上提出了一个异构云平台下能源有效的虚拟机部署算法.仿真实验表明,与MBFD算法及BFD算法相比,该算法不仅可以有效地降低系统的能源消耗,而且还提高了资源利用率,减少了资源的浪费.     

基于网卡虚拟化的高性能容器网络设计

单根I/O虚拟化技术为传统数据中心提供高效的服务器整合能力和灵活的应用部署能力,通过将多个网卡直通到虚拟机,减少额外包复制带来的性能损失,使得网络I/O具有接近主机的性能。然而,在网络功能虚拟化场景下单独使用单根I/O虚拟化技术会降低传统数据中心的网络I/O虚拟化性能。针对网络功能虚拟化长链场景,结合单根I/O虚拟化技术和软件虚拟化技术,设计基于网卡虚拟化的高性能容器网络。通过转发模块判断网络流量的目的地址,寻找最优的流量转发路径,实现流量的灵活转发。利用基于脚本程序的自动化部署模块,对每个节点业务进行支持动态增删服务的配置,便于用户对网络进行管理和修改。实验结果表明,在网络功能虚拟化长链场景下,相比单根I/O虚拟化技术,该网络延迟降低约20%,同时能够有效提高网络吞吐量,解决数据中心的网络I/O虚拟化问题。     

计算机系统与计算机网络中的动态优化:模型、求解与应用

动态优化是计算机系统与计算机网络中进行资源分配与任务调度等方面研究所采用的主要理论工具之一.目前,国内外已开展大量研究,致力于深化动态优化的理论研究与工程应用.文中从模型、求解与应用3个角度,对马尔可夫决策过程动态优化理论模型进行了综述,并重点介绍了将动态优化理论与随机Petri网理论相结合的马尔可夫决策Petri网和随机博弈网模型,详细讨论了这些模型的建模方法、求解算法与一些应用实例.最后,对全文进行了总结,并对未来可能的研究方向进行了展望.     

A congruence relation for sPBC

In this paper we define a congruence relation for regular terms of sPBC (stochastic Petri Box Calculus), by means of which we identify those processes that have the same behaviour, not only in terms of the multiactions that they can perform, but also taking into account the stochastic information that they have associated. In order to define this equivalence relation we have to define an adequate semantics for the synchronization operator, as well as a new labelled transition system for regular terms of sPBC.     

容错网络服务器系统可用性

通过分析服务器群集系统的结构和工作原理,采用随机Petri网分别建立基本处理单元的软硬件可用性模型、共享数据磁盘可用性模型和服务器可用性模型。综合各个模型,得到服务器集群系统的可用性模型,通过仿真分析可知,采用集群技术可以有效提高服务器的可靠性。     

基于延迟特性的改进随机Petri网建模与分析

随机Petri网能够分析过程中的随机特性,但是不能有效地描述延迟和花费问题.为了解决上述问题,提出了一种基于延迟特性的随机Petri网模型.该模型能根据延迟时间和过程的随机性得到总的时间和花费特性.给出了状态类延迟时间和延迟花费的串联及并联化简方法.最后,通过首都机场的实例说明该方法能更好地表示出应急救援的时间和花费特性.     

基于随机过程的容侵系统可信性量化方法

运用马尔可夫过程分析了容侵系统的可信性,结合SITAR容侵系统体系中的状态迁移模型,给出了一种基于随机过程的容侵系统可信性的可用度量化方法。最后在此基础上讨论了入侵容忍系统的性质。