On DRC-cycle covering in optical networks

Abstract

This paper consider the case when the physical graph G=C_tn (a ring of size tn) and logical graph is λK_t(n). We want to minimize the number of cycles ρ(n^t,λ) in the DRC covering. For this problem, we obtain the optimal solutions when both n and t are odd.