Vertex disjoint routings of cycles over tori

Authors

  • Jean-Claude Bermond,

    Corresponding author
    1. MASCOTTE, joint project I3S-CNRS/INRIA/Université de Nice-Sophia Antipolis, 2004 Route des Lucioles, BP93, F-06902, Sophia-Antipolis Cedex, France
    • MASCOTTE, joint project I3S-CNRS/INRIA/Université de Nice-Sophia Antipolis, 2004 Route des Lucioles, BP93, F-06902, Sophia-Antipolis Cedex, France
    Search for more papers by this author
  • Min-Li Yu

    Corresponding author
    1. Dept. of Mathematics and Statistics, University College of the Fraser Valley, Abbotsford, B.C., Canada, V2S 4N2
    • Dept. of Mathematics and Statistics, University College of the Fraser Valley, Abbotsford, B.C., Canada, V2S 4N2
    Search for more papers by this author

Abstract

We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consider here the case when the physical network is T(n), a torus of size n by n, the subnetworks are cycles and the communication scheme is all-to-all or total exchange (where all pairs of vertices communicate). We will represent the communication requests by a logical graph: a complete graph for the scheme of all-to-all. This problem can be modeled as follows: find a cycle partition or covering of the request edges of Kmath image, such that for each cycle in the partition, its request edges can be routed in the physical network T(n) by a set of vertex disjoint paths (equivalently, the routings with the request cycle form an elementary cycle in T(n)). Let the load of an edge of the WDM network be the number of paths associated with the requests using the edge. The cost of the network depends on the total load (the cost of transmission) and the maximum load (the cost of equipment). To minimize these costs, we will search for an optimal (or quasi optimal) routing satisfying the following two conditions: (a) each request edge is routed by a shortest path over T(n), and (b) the load of each physical edge resulting from the routing of all cycles of S is uniform or quasi uniform. In this article, we find a covering or partition of the request edges of Kmath image into cycles with an associated optimal or quasi optimal routing such that either (1) the number of cycles of the covering is minimum, or (2) the cycles have size 3 or 4. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 49(3), 217–225 2007

Ancillary