Self-healing topology discovery protocol for software defined networks

“© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. http://ieeexplore.ieee.org/document/8319433/”This letter presents the design of a self-healing protocol for automatic discovery and maintenance of the network topology in Software Defined Networks (SDN). The proposed protocol integrates two enhanced features (i.e. layer 2 topology discovery and autonomic fault recovery) in a unified mechanism. This novel approach is validated through simulation experiments using OMNET++. Obtained results show that our protocol discovers and recovers the control topology efficiently in terms of time and message load over a wide range of generated networks.Peer ReviewedPostprint (author's final draft

Energy-aware routing in multiple domains software defined networks

The growing energy consumption of communication networks has attracted the attention of the networking researchers in the last decade. In this context, the new architecture of Software-Defined Networks (SDN) allows a flexible programmability, suitable for the power-consumption optimization problem. In this paper we address the issue of designing a novel distributed routing algorithm that optimizes the power consumption in large scale SDN with multiple domains. The solution proposed, called DEAR (Distributed Energy- Aware Routing), tackles the problem of minimizing the number of links that can be used to satisfy a given data traffic demand under performance constraints such as control traffic delay and link utilization. To this end, we present a complete formulation of the optimization problem that considers routing requirements for control and data plane communications. Simulation results confirm that the proposed solution enables the achievement of significant energy savings.Peer ReviewedPostprint (published version

Discovering the network topology: an efficient approach for SDN

Network topology is a physical description of the overall resources in the network. Collecting this information using efficient mechanisms becomes a critical task for important network functions such as routing, network management, quality of service (QoS), among many others. Recent technologies like Software-Defined Networks (SDN) have emerged as promising approaches for managing the next generation networks. In order to ensure a proficient topology discovery service in SDN, we propose a simple agents-based mechanism. This mechanism improves the overall efficiency of the topology discovery process. In this paper, an algorithm for a novel Topology Discovery Protocol (SD-TDP) is described. This protocol will be implemented in each switch through a software agent. Thus, this approach will provide a distributed solution to solve the problem of network topology discovery in a more simple and efficient way.Peer ReviewedPostprint (published version

Z2Z4-additive cyclic codes, generator polynomials and dual codes

A ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code ${\cal C}\subseteq{\mathbb{Z}}_2^\alpha\times{\mathbb{Z}}_4^\beta$ is called cyclic if the set of coordinates can be partitioned into two subsets, the set of ${\mathbb{Z}}_2$ and the set of ${\mathbb{Z}}_4$ coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant. These codes can be identified as submodules of the $\mathbb{Z}_4[x]$-module $\mathbb{Z}_2[x]/(x^\alpha-1)\times\mathbb{Z}_4[x]/(x^\beta-1)$. The parameters of a ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive cyclic code are stated in terms of the degrees of the generator polynomials of the code. The generator polynomials of the dual code of a ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive cyclic code are determined in terms of the generator polynomials of the code ${\cal C}$