This paper analyzes a controllable discrete-time machine repair problem withL operating machines and two repairmen. The number of working servers can be adjusteddepending on the number of failed machines in the system one at a time at machine's failure orat service completion epochs. Analytical closed-form solutions of the stationary probabilities ofthe number of failed machines in the system a...

this paper analyzes a controllable discrete-time machine repair problem withl operating machines and two repairmen. the number of working servers can be adjusteddepending on the number of failed machines in the system one at a time at machine's failure orat service completion epochs. analytical closed-form solutions of the stationary probabilities ofthe number of failed machines in the sys...

In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.? 

Fog computing is a promising paradigm for use as an efficient architecture Internet-of-Things applications. This architecture’s advantages include proximity, low latency, adaptable resource capacity, and distributed structure. A considerable amount of generated data their requisites to real-time processes cause fog nodes offload the number tasks others, causing trust issues. In this paper, each...