Helder M. N. S. Oliveira

Algorithm for FIPP p-cycle path protection in flexgrid networks

In optical networks, faults in links and nodes cause massive loss of data even if for short periods. Therefore, protection techniques have been developed to cope with failures. Among these techniques, p-cycle is very attractive since it provides ring-like speed of restoration in mesh topologies. In recent years, the technology of flexgrid networks has emerged as a solution for dealing with the diversity of bandwidth demands of network applications. However, very few investigations have been proposed for path protection in flexgrid networks. This paper introduces a novel algorithm to provide Failure-independent path protecting p-cycle for path protection in flexgrid networks. The proposed algorithm is compared to two other algorithms in the literature. Results indicate that the 100% protection for single failures can be provided by the proposed algorithm with low overhead to networks with high node connectivity.

Algorithm for Protection of Space Division Multiplexing Elastic Optical Networks

In recent years, elastic optical networks have emerged as a solution for dealing with the diversity of the bandwidth demands of network applications. The use of only two multiplexing dimensions has limited the network capacity. To ameliorate this problem, a third dimension has been added in space division multiplexing(SDM). As transmission rates increase so does the need for protection against network failures. Among the protection schemes,those protecting paths are of great interest due to their end-to-end solutions. This paper introduces a novel algorithm based on p-cycle to provide failure-independent path protection in elastic optical networks with SDM.

Protection in Elastic Optical Networks against up to Two Failures Based FIPP p-Cycle

Optical networks are subject to faults in links and nodes which can cause massive data loss. In the literature, many techniques have been proposed to deal with such failures in order to support continuous network operation. One of these techniques defines p-Cycles which provide ring-type protection and the speed of restoration of meshes. Morever, Flex grid networks emerged as a solution to deal with the diverse requirements of bandwidth. This paper presents two new algorithms to provide path protection using p-cycle path networks in Flex grid networks. Our algorithms provide 100% protection against single failure as well as against two failures.

The Minimum Interference p-Cycle Algorithm for Protection of Space Division Multiplexing Elastic Optical Networks

In optical networks, failures can imply in great loss of data due to high transmission rates, leading to the need of employment of protection mechanisms. This paper introduces a novel algorithm to provide Failure-independent path protecting p-cycle with minimum interference for path protection in elastic optical networks using space division multiplexing. The proposed protection algorithm reduces rejections of future requests and makes no assumption about specific patterns of arrival of requests. The algorithm is compared to the FIPPMC algorithm and to an algorithm based [1]. Results indicate that 100% protection for single failures can be provided by the proposed algorithm.

Traffic grooming and spectrum overlap in FIPP p-cycle for protection of elastic optical networks

Elastic optical networks has emerged as a solution for dealing with the diversity of bandwidth demands of network applications. However, networks are not sufficiently resilient, survivable, highly available and dependable, therefore, protection techniques have been developed to cope with failures. Among these techniques, p-cycle is a very attractive once since it provides ring-like speed of restoration in mesh topologies. This paper presents a new algorithms to provide path protection using p-cycle path, traffic grooming and overlap spectrum in elastic optical networks. The proposed algorithm is compared to others existing in the literature. Results indicate that the our algorithm can provide up to 40% less blocking when compared to existing other algorithms.

Comparison of Network Protection in Three-Layer IP/MPLS-over-OTN-over-DWDM Networks

In multilayer networks, protection can be accomplished in any of the layers. However, which layer to protect most remains an important problem. In this paper, we consider a three-layer with IP/MPLS-over-OTN-over-DWDM in which we consider an optimization modeling framework incorporating modularization of its capacity for protection in any layer. Our resulting study, conducted on two topologies, shows that the cost ratio of different layers is an important factor in answering this question, as well as the actual modular values of the capacity used. Furthermore, we found that the cost providing protection in the OTN layer is highly influenced by the network connectivity.

Algorithm for shared path for protection of space division multiplexing elastic optical networks

Although shared path protection has been employed for protecting traffic flows against network failures, to our knowledge, it has not been considered for path protection in elastic optical networks with space division multiplexing (SDM). In this paper, we propose an algorithm to dynamically generate primary and backup paths using a shared backup scheme. The proposed algorithm is compared to the Failure-Independent Path Protecting for MultiCore network (FIPPMC) algorithm and to the Shared path with Spectrum and Core Assignment (SSCA) algorithm. Results indicate that 100% protection for single failures can be provided by the proposed algorithm with low overhead when compared to the other two algorithms.

The minimum interference p-cycle algorithm for protection of space division multiplexing elastic optical networks

In optical networks, failures can imply in great loss of data due to high transmission rates, leading to the need of employment of protection mechanisms. This paper introduces a novel algorithm to provide Failure-independent path protecting p-cycle with minimum interference for path protection in elastic optical networks using space division multiplexing. The proposed protection algorithm reduces rejections of future requests and make no assumption about specific patterns of arrival of requests. The algorithm is compared to FIPPMC algorithm and a algorithm based on methods of [1]. Results indicate that the 100% protection for single failures can be provided by the proposed algorithm.