On DRC-covering of Kn by cycles

Jean-Claude Bermond 1 David Coudert 1 Min-Li Yu 2
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : This paper considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on INF-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 Kn, where V(Kn) = V(G), such that each cycle in the covering satisfies the disjoint routing constraint (DRC), relatively to G, which can be stated as follows: to each edge of Kn we associate in G a path and all the paths associated to the edges of a cycle of the covering must be vertex disjoint. Here we consider the case where G = Cn, a ring of size n and we want to minimize the number of cycles in the covering. We give optimal solutions for the problem as well as for variations of the problem, namely, its directed version and the case when the cycle length is fixed to 4.
Liste complète des métadonnées

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00429205
Contributor : David Coudert <>
Submitted on : Sunday, November 1, 2009 - 7:48:22 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Document(s) archivé(s) le : Thursday, June 17, 2010 - 6:57:47 PM

File

BCY-JCD03.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jean-Claude Bermond, David Coudert, Min-Li Yu. On DRC-covering of Kn by cycles. Journal of Combinatorial Designs, Wiley, 2003, 11 (2), pp.100 - 112. ⟨10.1002/jcd.10040⟩. ⟨inria-00429205⟩

Share

Metrics

Record views

312

Files downloads

143