Аннотация:We consider a Jackson network with regenerative input flows in which every server is subject to breakdowns. Breakdowns and repairs occur in accordance with a Markov chain trajectory. We assume that all the servers work under critical traffic conditions, i.e. all the traffic coefficients are equal to one. We establish a theorem on a strong approximation of the vector of queue lengths by a reflected Brownian motion in positive orthant.