Analysis of cyclic queueing networks with parallelism and vacation

Abstract

The aim of this paper is to improve the machine interference model with vacation to deal with more recent problems of the communication area. To this scope the model is extended to include parallelism in the vacation station. The underlying Markov process is analyzed and a state arrangement is found that yields an efficient matrix-analytic technique that substantially lowers down the time- and space-complexity of standard methods. A numerical example of the method effectiveness is presented, and an example of resource allocation is introduced that finds applications in the QoS management of wireless networks.