On DRC-covering of lambda K-t(n) by cycles
This paper considers the cycle covering of complete multipartite graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from each other. The problem can be stated as follows: for a given graph G, find a cycle covering of the edge set of lambda K-t(n), where V(K-t(n)) = V(G), such that each cycle in the covering satisfies the disjoint routing constraint (DRC). Here we consider the case where G=C-tn, a ring of size tn and we want to minimize the number of cycles rho(n(t), lambda) in the covering. For the problem, we give the lower bound of rho(n(t), lambda), and obtain the optimal solutions when n is even or n is odd and both lambda and t are even.
drc-covering k-t(n) cycle wdm network