Abstract. In this paper, we consider communication systems with periodically varying parameters, such as success probability when a user requests service. These systems may be described by a Markov chain of a cyclic structure. We concentrate on investigating the average delay value in such systems. In the general case, a direct solution is given with its complexity being linear of the number of Markov chain states. For the case when the parameters of a system are varying slowly, a fast algorithm of the average delay calculation is proposed. Some applications of our results to contemporary communication systems are demonstrated.