Software rejuvenation and resource reservation policies for optimizing server resource availability using cyclic nonhomogeneous Markov chains

Software rejuvenation is modeled in a client–server system, which provides resources to priority classes of users. To assure availability, resource reservation policies are adopted for the higher priority classes. In addition software rejuvenation is proposed to optimize resource availability. The system is modeled by a cyclic nonhomogeneous Markov chain to capture the variation of the arrival and service rates during a day period. An optimization problem is solved based on a similar previous work and given the optimal resource reservation policy obtained by its solution, rejuvenation is performed and the optimal rejuvenation policy is determined. As a measure of resource availability the blocking probability of each priority class is used. Performability indicators expressing the total cost are also derived, with respect to the optimal resource reservation and optimal rejuvenation policies, to examine whether rejuvenation benefits the system in terms of cost. To derive the blocking probabilities, the limiting probability distribution is computed using explicit generalized approximate inverse preconditioning for solving efficiently sparse linear systems of algebraic equations. Copyright © 2012 John Wiley & Sons, Ltd.     

A delay-time-based maintenance model of a multi-component system

There is a well established literature on delay-time modelsof regular inspection policies where inspections may or maynotbe perfect, and where the initial point u of a defect arisesas a homogeneous Poisson process. This paper extends the modellingin two ways. The first is to include the observed practice wherethe multi-component system is inspected not only on a plannedbasis, but also when a component fails. The second extensionis to use a nonhomogeneous Poisson process to describe defectarrivals in the system. An inspection–replacement modelbased upon these two extensions is then developed for a multi-componentsystem. The total expected cost per unit time is minimized withrespect to theinspection intervals and the system replacementtime. The likelihood function of the time of failures and thenumber of defects found at inspections is established, in orderto estimate model parameters based upon routinely collectedmaintenance data. As a special case of the general model, aninspection model—based upon a homogeneous Poisson processof defects arising—is also proposed, which has a relativelysimple structure. Both simulated and real-life data of failuresand defects identified at inspections are used to test the modelsand parameter-estimating procedure.     

Optimal control of a removable and non-reliable server in an infinite and a finite M/H2/1 queueing system

This paper deals with a single removable and non-reliable server in both an infinite and a finite queueing system with Poisson arrivals and two-type hyper-exponential distribution for the service times. The server may be turned on at arrival epochs or off at service completion epochs. Breakdown and repair times of the server are assumed to follow a negative exponential distribution. Conditions for a stable queueing system, that is steady-state, are provided. Cost models for both system capacities are respectively developed to determine the optimal operating policy numerically at minimum cost. This paper provides the minimum expected cost and the optimal operating policy based on assumed numerical values given to the system parameters, as well as to the cost elements. Sensitivity analysis is also investigated.     

An Invariance in the Priority Queue with Generalized Server Vacations and Structured Batch Arrivals

Abstract

Shanthikumar (Shanthikumar, J.G. Level crossing analysis of priority queues and a conservation identity for vacation models. Nav. Res. Log. 1989, 36, 797–806) studied the priority M/G/1 queue with server vacations and found that the difference between the waiting time distribution under the non‐preemptive priority (NPP) and that under the preemptive‐resume priority (PRP) is independent of the vacation policy. We extend this interesting property: (i) to the generalized vacations which includes the two vacation policies considered by Shanthikumar; (ii) to the structured batch Poisson arrival process; and (iii) to the discrete‐time queues.     

A fuzzy based threshold policy for a single server retrial queue with vacations

In this paper we deal with a single server retrial queue with vacations. The server serves the customers until the system becomes empty, then it takes a vacation. The system consists of two types of costs. The blocking cost is considered whenever a customer is blocked either because of the server is busy or off. There is also a cost each time the server is turned on. The problem is to find an effective policy for turning on the dormant server. We propose a Fuzzy Based Threshold Policy (FBTP) to control the server, substitute for conventional threshold policies. The FBTP is based on four input parameters, an inference stage and it is tuned up using a stochastic List Based Threshold Accepting (LBTA) algorithm. Simulation models are developed to validate the fuzzy controller. Numerical experiments are provided to show that the proposed method is superior to crisp threshold policies.     

A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity

We study a single removable server in an infinite and a finite queueing systems with Poisson arrivals and general distribution service times. The server may be turned on at arrival epochs or off at service completion epochs. We present a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining service time, to obtain the steady state probability distribution of the number of customers in a finite system. The method is illustrated analytically for three different service time distributions: exponential, 3-stage Erlang, and deterministic. Cost models for infinite and finite queueing systems are respectively developed to determine the optimal operating policy at minimum cost.     

Optimal strategy policy in batch arrival queue with server breakdowns and multiple vacations

This paper considers a like-queue production system in which server vacations and breakdowns are possible. The decision-maker can turn a single server on at any arrival epoch or off at any service completion. We model the system by an M^[x]/M/1 queueing system with N policy. The server can be turned off and takes a vacation with exponential random length whenever the system is empty. If the number of units waiting in the system at any vacation completion is less than N, the server will take another vacation. If the server returns from a vacation and finds at least N units in the system, he immediately starts to serve the waiting units. It is assumed that the server breaks down according to a Poisson process and the repair time has an exponential distribution. We derive the distribution of the system size through the probability generating function. We further study the steady-state behavior of the system size distribution at random (stationary) point of time as well as the queue size distribution at departure point of time. Other system characteristics are obtained by means of the grand process and the renewal process. Finally, the expected cost per unit time is considered to determine the optimal operating policy at a minimum cost. The sensitivity analysis is also presented through numerical experiments.     

Focus on economy or ecology? A three‐dimensional trade‐off based on ecological carrying capacity in southwest China

Economic growth and human activities challenge the regional harmony of the economy and environment. Based on an evaluation of ecological carrying capacity (ECC), we have constructed a three‐dimensional trade‐off model for socially harmonious development for the Sichuan and Yunnan regions in southwest China. The results demonstrate that there is a continuous increase in socioeconomic coordination (SEC; slope > 0.23) and a change in the ECC in the study area, characterized by subtle fluctuations from 2000 through 2008. This was primarily due to the loss of resource and environment carrying capacity wiping out the profits of SEC. Significant government aid during the postdisaster reconstruction and more attention being paid to the environment in policy resulted in a faster increase in ECC (slope > 0.38) from 2008 to 2016. Based on this trade‐off model, managers could deeply understand the relationship between resources, the economy, and ecology. Summary for Managers

• Ecological environment protection is increasingly crucial in Sichuan and Yunnan regions as they feel the effects of climate change and human activities.
• The three‐dimensional trade‐off model measuring socially coordinated development is a modified multiobjective, decision‐making model.
• Based on this trade‐off model, managers could, understand the relationship between resources, the economy, and ecology.
• It can help manage our environmental assets and plan ecological conservation, to ensure that the environment maintains its capacity to serve the societal development.

     

A bivariate optimal replacement policy for a system subject to a generalized failure and repair process

Traditionally, in the studies of the optimal maintenance policies for repairable systems, the nonhomogeneous Poisson process model, which corresponds to the minimal repair process, has been intensively applied. However, in many practical situations, the repair type is not necessarily minimal. In this article, a new repair process based on a new counting process model (so‐called the generalized Polya process) is introduced. Then, the issue of the optimal replacement problem is discussed. A bivariate preventive replacement policy is developed and the properties of the optimal policy are studied. Illustrative examples are also presented. In addition, a comparison with a conventional replacement policy is performed.     

Batch arrival queues under vacation policies with server breakdowns and startup/closedown times

This paper studies the operating characteristics of an M^[x]/G/1 queueing system under vacation policies with startup/closedown times, where the vacation time, the startup time, and the closedown time are generally distributed. When all the customers are served in the system exhaustively, the server shuts down (deactivates) by a closedown time. After shutdown, the server operates one of (1) multiple vacation policy and (2) single vacation policy. When the server reactivates since shutdown, he needs a startup time before providing the service. If a customer arrives during a closedown time, the service is immediately started without a startup time. The server may break down according to a Poisson process while working and his repair time has a general distribution. We analyze the system characteristics for the vacation models.     

Analysis of a Two‐Phase Queueing System with Vacations and Bernoulli Feedback

Abstract

We consider a two‐phase queueing system with server vacations and Bernoulli feedback. Customers arrive at the system according to a Poisson process and receive batch service in the first phase followed by individual services in the second phase. Each customer who completes the individual service returns to the tail of the second phase service queue with probability 1 ? σ. If the system becomes empty at the moment of the completion of the second phase services, the server takes vacations until he finds customers. This type of queueing problem can be easily found in computer and telecommunication systems. By deriving a relationship between the generating functions for the system size at various embedded epochs, we obtain the system size distribution at an arbitrary time. The exhaustive and gated cases for the batch service are considered.     

An Approximation of a Markov Decision Process for Resource Planning

This study presents an approximation of a Markovian decision process to calculate resource planning policies for environments with probabilistic resource demand. These policies provide a means of periodic determination of the quantity of resources required to be available. Managers may also use these approximation models to perform the sensitivity analysis of resource demand and the cost/reward parameters. The decision policy can be applied to many resource planning situations including manufacturing or construction equipment purchasing or leasing, airline capacity, professional services staffing, and computer/management information systems capacity.     

Cyber vulnerability maintenance policies that address the incomplete nature of inspection

In cybersecurity, incomplete inspection, resulting mainly from computers being turned off during the scan, leads to a challenge for scheduling maintenance actions. This article proposes the application of partially observable decision processes to derive cost‐effective cyber maintenance actions that minimize total costs. We consider several types of hosts having vulnerabilities at various levels of severity. The maintenance cost structure in our proposed model consists of the direct costs of maintenance actions in addition to potential incident costs associated with different security states. To assess the benefits of optimal policies obtained from partially observable Markov decision processes, we use real‐world data from a major university. Compared with alternative policies using simulations, the optimal control policies can significantly reduce expected maintenance expenditures per host and relatively quickly mitigate the most important vulnerabilities.     

On the optimal control of a two-queue polling model

This paper deals with two M/M/1 queues served by a single server with threshold switching. Our main goal is to solve the Poisson equation and, as a result, give expressions for the long-run expected average cost of holding units and switching actions of the server, and the bias vector.     

Optimality of a Threshold Policy in theM/M/ queue with repeated vacations

Consider anM/M/1 queueing system with server vacations where the server is turned off as soon as the queue gets empty. We assume that the vacation durations form a sequence of i.i.d. random variables with exponential distribution. At the end of a vacation period, the server may either be turned on if the queue is non empty or take another vacation. The following costs are incurred: a holding cost ofh per unit of time and per customer in the system and a fixed cost of each time the server is turned on. We show that there exists a threshold policy that minimizes the long-run average cost criterion. The approach we use was first proposed in Blanc et al. (1990) and enables us to determine explicitly the optimal threshold and the optimal long-run average cost in terms of the model parameters.     

基于累积损伤过程的不完全预防维护决策

基于累积损伤过程研究旧系统的不完全预防维护策略,冲击服从非时齐Poisson过程,并产生随机的损伤量,损伤量是加法累加的.系统在累积损伤量达到k或系统运行年龄达到T时进行计划内预防维护.在两次计划内预防维护之间,当累积损伤量达到预定水平K (k K)时,对系统进行计划外维护,其费用高于计划内预防维护,利用再生过程理论得到单位时间维护成本,讨论在时齐Poisson过程下的时间预防维护策略与水平预防维护策略,同时给出算例.     

Estimating characteristics of queueing networks using transactional data

We are motivated by queueing networks in which queues are difficult to observe but services are easy to record. Our goal is to estimate the queues from service data. More specifically, we consider an open queueing network with Poisson external arrivals, multi‐server stations, general service times and Markovian switches of customers between stations. Customers' transitions between stations may be either immediate or of exponentially distributed durations. Each customer is supplied with an Identification Number (ID) upon entering the network. Operational data is collected which includes transaction times (starts and terminations of services) and ID's of served customers. Our objective is to estimate the evolution of the queues in the network, given the collected data. We cover estimation at both end of busy periods and in real time. The applicability of the theory is demonstrated by analyzing a service operation. This revised version was published online in June 2006 with corrections to the Cover Date.     

Periodic review lost-sales inventory models with compound Poisson demand and constant lead times of any length

In almost all literature on inventory models with lost sales and periodic reviews the lead time is assumed to be either an integer multiple of or less than the review period. In a lot of practical settings such restrictions are not satisfied. We develop new models allowing constant lead times of any length when demand is compound Poisson. Besides an optimal policy, we consider pure and restricted base-stock policies under new lead time and cost circumstances. Based on our numerical results we conclude that the latter policy, which imposes a restriction on the maximum order size, performs almost as well as the optimal policy. We also propose an approximation procedure to determine the base-stock levels for both policies with closed-form expressions.     

Queueing systems on a circle

Consider a ring on which customers arrive according to a Poisson process. Arriving customers drop somewhere on the circle and wait there for a server who travels on the ring. Whenever this server encounters a customer, he stops and serves the customer according to an arbitrary service time distribution. After the service is completed, the server removes the client from the circle and resumes his journey.We are interested in the number and the locations of customers that are waiting for service. These locations are modeled as random counting measures on the circle. Two different types of servers are considered: The polling server and the Brownian (or drunken) server. It is shown that under both server motions the system is stable if the traffic intensity is less than 1. Furthermore, several earlier results on the configuration of waiting customers are extended, by combining results from random measure theory, stochastic integration and renewal theory.