Cycle Covering (2001)
| Venue: | In ACM Symposium on Parallel Algorithms and Architectures SPAA |
| Citations: | 5 - 2 self |
BibTeX
@INPROCEEDINGS{Bermond01cyclecovering,
author = {J-C. Bermond and L. Chacon and D. Coudert and F. Tillerot},
title = {Cycle Covering},
booktitle = {In ACM Symposium on Parallel Algorithms and Architectures SPAA},
year = {2001},
pages = {4--6}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on the case where the optical WDM network is a ring, there are requests between any pair of vertices and the covering is done with small cycles. This problem can be modelled as follows: Find a covering of the edges of a logical graph I (here the complete graph K n ) by subgraphs I k of a certain kind (here cycles C k of length k), such that, for each I k , there exists in the physical graph G (here C n ) a disjoint routing of the edges of I k . The aim is to minimize the number of subgraphs I k in the covering. We give optimal solutions for that problem. Keywords Cycle covering, WDM, graph, survivability. 1
