Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous markov modeling
Resource availability optimization is studied on a server-client system where different users are partitioned into priority classes. The aim is to provide higher resource availability according to the priority of each class. For this purpose, resource reservation is modeled by a homogeneous continuous time Markov chain (CTMC), but also by a cyclic non-homogeneous Markov chain (CNHMC) as there is a cyclic behavior of the users' requests for resources. The contribution of the work presented consists in the formulation of a multiobjective optimization problem for both the above cases that aims to determine the optimal resource reservation policy providing higher levels of resource availability for all classes. The optimization problem is solved either with known methods or with a proposed kind of heuristic algorithm. Finally, explicit generalized approximate inverse preconditioning methods are adopted for solving efficiently sparse linear systems that are derived, in order to compute resource availability.
|Year of publication:||
|Authors:||Koutras, V.P. ; Platis, A.N. ; Gravvanis, G.A.|
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 198.2009, 2, p. 545-556
|Keywords:||Server resources Priority classes Resource availability modeling Non-homogeneous Markov chains Optimization Approximate inverse matrix algorithms Preconditioning|
Saved in favorites
Similar items by person