Results 1 
5 of
5
Minimizing Electronic Line Terminals for Automatic Ring Protection in General WDM Optical Networks
 IEEE Journal of Selected Area on Communications
, 2002
"... Automatic ring protection provides simple and rapid fault protection and restoration in telecommunication networks. To implement the automatic ring protection in general wavelengthdivision multiplexing (WDM) optical networks, the lightpaths are partitioned into groups each of which can be carried in ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Automatic ring protection provides simple and rapid fault protection and restoration in telecommunication networks. To implement the automatic ring protection in general wavelengthdivision multiplexing (WDM) optical networks, the lightpaths are partitioned into groups each of which can be carried in a simple cycle of the underlying network. As the electronic line terminals are the dominant cost factor in the deployment of WDM optical networks, we study how to generate these partitions with minimum electronic line terminals. This optimization problem is NPhard. We develop two polynomialtime approximation algorithms, with performance guarantees between 1.5 and 1.6 and between 1.5 and 1 5+ , respectively. The second algorithm can be adapted, with the same performance guarantees, to the problem in which lightpaths are not prespecified and only the endpoints of each connection are given. Both algorithms can be easily adapted, with the same performance guarantees, to the problem in which only link protection is desired, and each group must be carried in a closed trail. The first algorithm matches and the second algorithm improves the approximation ratio obtained independently by Eilam et al. (2000).
Cycle Covering
 In ACM Symposium on Parallel Algorithms and Architectures SPAA
, 2001
"... This paper considers the design of a survivable WDM network based on covering the initial network with subnetworks, 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 i ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This paper considers the design of a survivable WDM network based on covering the initial network with subnetworks, 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
Cost vs. Quality: Tradeoffs in Communication Networks
, 2000
"... 1 List of Figures 3 List of Terms 5 1 Introduction 6 1.1 Background : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 1.2 The Virtual Topology Design Problem in AllOptical Networks : : : : : : : : 8 1.2.1 Background, Definitions and Goals : : : : : : : : : : : : : : : : : : ..."
Abstract
 Add to MetaCart
1 List of Figures 3 List of Terms 5 1 Introduction 6 1.1 Background : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 1.2 The Virtual Topology Design Problem in AllOptical Networks : : : : : : : : 8 1.2.1 Background, Definitions and Goals : : : : : : : : : : : : : : : : : : : 8 1.2.2 Contribution : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 12 1.3 The Design of Routing Strategies : : : : : : : : : : : : : : : : : : : : : : : : 13 1.3.1 Background, Definitions, and Goals : : : : : : : : : : : : : : : : : : : 13 1.3.2 Contribution : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 15 1.4 Published Work : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 16 1.5 Organization of the Work : : : : : : : : : : : : : : : : : : : : : : : : : : : : 16 I The Design of the Virtual Topology 17 2 A Formal Model 18 2.1 Survivability and the Layered Hierarchy : : : : : : : : : : : : : : : : : : : : 18 2.2 Survivability within the Opti...
General Terms
, 2009
"... This study considers the design of a survivable WDM network based on covering the initial network with subnetworks, which are protected independently from each other. ..."
Abstract
 Add to MetaCart
This study considers the design of a survivable WDM network based on covering the initial network with subnetworks, which are protected independently from each other.
Vertex Disjoint Routings of Cycles over Tori
, 2009
"... 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 communic ..."
Abstract
 Add to MetaCart
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 alltoall 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 alltoall. This problem can be modeled as follows: find a cycle partition or covering of the request edges of Kn2, 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) 1 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 paper, we find a covering or partition of the request edges of K n 2 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.