Analytical modelling of communication network with unreliable servers and finite buffers

In this paper we model a communication network as an open queuing network with Mt/Mt/n/m nodes. It is assumed that the mean time between events in the input flow and mean service time are exponentially distributed with rate parameters depending on time t. Each server in a system can fail and be recovered, the parameters of service, failures and recovery also depend on the number of node j and the number of customers in a system. Servers in the network nodes are completely recovered after failures. The recovery time is distributed according to an exponential law. The main characteristics of the performance and reliability of the system are analysed in this paper. We derive the probability that the application received at time t, will be served and the availability of a system.