Translucent WDM Optical Networks Research Articles

On the improvement of network resource utilization efficiency for the establishment of static dependable connections in SRLG-constrained WDM translucent networks

In this paper, we investigate the problem of establishing static connections with fault-tolerant requirements, also known as dependable connections, taking into account quality of transmission constraints. To the best of our knowledge, this is the first study that tackles the aforementioned problem under shared risk link group (SRLG) constraints in translucent WDM optical mesh networks where typically a set of strategically localized network nodes are equipped with regeneration capability to overcome physical-layer impairment effects. A novel cross-layer heuristic approach is introduced to solve the problem for an heterogeneous networked scenario relying on a cost-effective two-stage protection procedure which combines the well-known path protection and partial path protection schemes in order to ensure instantaneous recovery from any SRLG-failure event. The proposed heuristic integrates a generic auxiliary graph model that incorporates various network heterogeneity factors such as the number of transceivers at each network node, the number of wavelengths on each fiber link, and the regeneration capability of each node, represented by different edges in the constructed graph. Moreover, the integrated auxiliary graph can be applied efficiently to model either single- or mixed-line-rate translucent WDM optical networks wherein different modulation formats are employed in order to support the transmission at different line rates. Our solution approach aims at maximizing the total number of accommodated requests by reducing network resource consumption through the simultaneous use of the backup---backup and primary---backup multiplexing techniques. We, here, present extended versions of these two techniques that generalize the sharing concept to some other important node resources--specifically, regeneration equipments which constitute the major cost factor in optical transport networks--in addition to link resources (i.e., wavelength channels). As far as we know, this is the first attempt to deploy simultaneously generalized versions of the backup---backup and primary---backup multiplexing techniques when considering static traffic patterns without compromising the 100 % fault-recoverability guarantee. The performances of the proposed heuristic are evaluated and discussed through extensive numerical experiments carried out on different network topologies. Significant improvements are demonstrated, either in terms of network blocking performance or in terms of resource utilization efficiency, in comparison with previously proposed approaches.

Optimal regenerator assignment and resource allocation strategies for translucent optical networks

Physical layer impairments in wavelength-routed networks limit the maximum distance, a signal can travel in the optical domain, without significant distortion. Therefore, signal regeneration is required at some intermediate nodes for long-haul lightpaths. In translucent WDM networks, sparsely located regenerators at certain nodes can be used to offset the impact of physical layer impairments. The routing and wavelength assignment (RWA) techniques in such translucent networks need to take into consideration the availability of regenerators and the maximum optical reach of the transparent lightpaths (without any regeneration). Although there has been significant research interest in RWA algorithms for translucent networks, much of the research has focused on dynamic RWA techniques. Only a handful of recent papers have considered the static (offline) case, and they typically propose heuristic algorithms to solve this complex design problem for practical networks. In this paper, we propose a generalized integer linear program (ILP) based formulation for static regenerator assignment and RWA in translucent WDM optical networks, with sparse regenerator placement. To the best of our knowledge, such a formulation that optimally allocates resources for a set of lightpaths for translucent networks, given the physical network, the locations of the regenerators, and the maximum optical reach has not been considered before. The proposed formulation is important for two reasons. First, it can serve as a benchmark for evaluating different heuristic approaches that may be developedin the future. Second, we show that using a novel node representation technique, it is possible to drastically reduce the number of integer variables. This means that unlike existing ILP formulations, our approach can actually be used to generate optimal solutions for practical networks, with hundreds of lightpath demands.

Offline Impairment-Aware Routing and Wavelength Assignment Algorithms in Translucent WDM Optical Networks

Physical impairments in optical fiber transmission necessitate the use of regeneration at certain intermediate nodes, at least for certain lengthy lightpaths. We design and implement impairment-aware algorithms for routing and wavelength assignment (IA-RWA) in translucent optical networks. We focus on the offline version of the problem, where we are given a network topology, the number of available wavelengths and a traffic matrix. The proposed algorithm selects the 3R regeneration sites and the number of regenerators that need to be deployed on these sites, solving the regenerator placement problem for the given set of requested connections. The problem can be also posed in a slightly different setting, where a (sparse) placement of regenerators in the network is given as input and the algorithm selects which of the available regenerators to use, solving the regenerator assignment problem. We formulate the problem of regenerator placement and regenerator assignment, as a virtual topology design problem, and address it using various algorithms, ranging from a series of integer linear programming (ILP) formulations to simple greedy heuristic algorithms. Once the sequence of regenerators to be used by the non-transparent connections has been determined, we transform the initial traffic matrix by replacing non-transparent connections with a sequence of transparent connections that terminate and begin at the specified 3R intermediate nodes. Using the transformed matrix we then apply an IA-RWA algorithm designed for transparent (as opposed to translucent) networks to route the traffic. Blocked connections are re-routed using any remaining regenerator(s) in the last phase of the algorithm.

Dynamic routing in translucent WDM optical networks: the intradomain case

Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes, allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters, receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.