Predictive Analytics Lead to Smarter Self-Organizing Directional Wireless Backbone Networks

Directional wireless systems are becoming a cost-effective approach towards providing a high-speed, reliable, broadband connection for the ubiquitous mobile wireless devices in use today. The most common of these systems consists of narrow-beam radio frequency (RF) and free-space-optical (FSO) links, which offer speeds between 100Mbps and 100Gbps while offering bit-error-rates comparable to fixed fiber optic installations. In addition, spatial and spectral efficiencies are accessible with directional wireless systems that cannot be matched with broadcast systems. The added benefits of compact designs permit the installation of directional antennas on-board unmanned autonomous systems (UAS) to provide network availability to regions prone to natural disasters, in maritime situations, and in war-torn countries that lack infrastructure security. In addition, through the use of intelligent network-centric algorithms, a flexible airborne backbone network can be established to dodge the scalability limitations of traditional omnidirectional wireless networks. Assuring end-to-end connectivity and coverage is the main challenge in the design of directional wireless backbone (DWB) networks. Conflating the duality of these objectives with the dynamical nature of the environment in which DWB networks are deployed, in addition to the standardized network metrics such as latency-minimization and throughput maximization, demands a rigorous control process that encompasses all aspects of the system. This includes the mechanical steering of the directional point-to-point link and the monitoring of aggregate network performance (e.g. dropped packets). The inclusion of processes for topology control, mobility management, pointing, acquisition, and tracking of the directional antennas, alongside traditional protocols (e.g. IPv6) provides a rigorous framework for next-generation mobile directional communication networks. This dissertation provides a novel approach to increase reliability in reconfigurable beam-steered directional wireless backbone networks by predicating optimal network reconfigurations wherein the network is modeled as a giant molecule in which the point-to-point links between two UASs are able to grow and retract analogously to the bonds between atoms in a molecule. This cross-disciplinary methodology explores the application of potential energy surfaces and normal mode analysis as an extension to the topology control optimization. Each of these methodologies provides a new and unique ability for predicting unstable configurations of DWB networks through an understanding of second-order principle dynamics inherent within the aggregate configuration of the system. This insight is not available through monitoring individual link performance. Together, the techniques used to model the DWB network through molecular dynamics are referred to as predictive analytics and provide reliable results that lead to smarter self-organizing reconfigurable beam-steered DWB networks. Furthermore, a comprehensive control architecture is proposed that complements traditional network science (e.g. Internet protocol) and the unique design aspects of DWB networks. The distinct ability of a beam-steered DWB network to adjust the direction of its antennas (i.e. reconfigure) in response to degraded effects within the atmosphere or due to an increased separation of nodes, is not incorporated in traditional network processes such re-routing mechanism, and therefore, processes for reconfiguration can be abstracted which both optimize the physical interconnections while maintaining interoperability with existing protocols. This control framework is validated using network metrics for latency and throughput and compared to existing architectures which use only standard re-routing mechanisms. Results are shown that validate both the analogous molecular modeling of a reconfigurable beam-steered directional wireless backbone network and a comprehensive control architecture which coalesces the unique capabilities of reconfiguration and mobility of mobile wireless backbone networks with existing protocols for networks such as IPv6

IDEALIST control and service management solutions for dynamic and adaptive flexi-grid DWDM networks

Wavelength Switched Optical Networks (WSON) were designed with the premise that all channels in a network have the same spectrum needs, based on the ITU-T DWDM grid. However, this rigid grid-based approach is not adapted to the spectrum requirements of the signals that are best candidates for long-reach transmission and high-speed data rates of 400Gbps and beyond. An innovative approach is to evolve the fixed DWDM grid to a flexible grid, in which the optical spectrum is partitioned into fixed-sized spectrum slices. This allows facilitating the required amount of optical bandwidth and spectrum for an elastic optical connection to be dynamically and adaptively allocated by assigning the necessary number of slices of spectrum. The ICT IDEALIST project will provide the architectural design, protocol specification, implementation, evaluation and standardization of a control plane and a network and service management system. This architecture and tools are necessary to introduce dynamicity, elasticity and adaptation in flexi-grid DWDM networks. This paper provides an overview of the objectives, framework, functional requirements and use cases of the elastic control plane and the adaptive network and service management system targeted in the ICT IDEALIST project

A Survey on the Contributions of Software-Defined Networking to Traffic Engineering

Since the appearance of OpenFlow back in 2008, software-defined networking (SDN) has gained momentum. Although there are some discrepancies between the standards developing organizations working with SDN about what SDN is and how it is defined, they all outline traffic engineering (TE) as a key application. One of the most common objectives of TE is the congestion minimization, where techniques such as traffic splitting among multiple paths or advanced reservation systems are used. In such a scenario, this manuscript surveys the role of a comprehensive list of SDN protocols in TE solutions, in order to assess how these protocols can benefit TE. The SDN protocols have been categorized using the SDN architecture proposed by the open networking foundation, which differentiates among data-controller plane interfaces, application-controller plane interfaces, and management interfaces, in order to state how the interface type in which they operate influences TE. In addition, the impact of the SDN protocols on TE has been evaluated by comparing them with the path computation element (PCE)-based architecture. The PCE-based architecture has been selected to measure the impact of SDN on TE because it is the most novel TE architecture until the date, and because it already defines a set of metrics to measure the performance of TE solutions. We conclude that using the three types of interfaces simultaneously will result in more powerful and enhanced TE solutions, since they benefit TE in complementary ways.European Commission through the Horizon 2020 Research and Innovation Programme (GN4) under Grant 691567 Spanish Ministry of Economy and Competitiveness under the Secure Deployment of Services Over SDN and NFV-based Networks Project S&NSEC under Grant TEC2013-47960-C4-3-

Disruption-Free Link Wake-up Optimisation for Energy Aware Networks

Part 1: Autonomic and Decentralized Management International audience Energy efficiency has become a major research topic in the Internet community as a result of unprecedented rise in the Information and Communication Technology (ICT) sector. One typical approach towards energy efficiency is to select a subset of IP routers or interfaces that will go to sleep mode during the off-peak period. However, on-the-fly network reconfiguration is generally deemed harmful especially to real time packets due to routing re-convergence. In this paper, we develop an efficient algorithm for achieving energy efficiency which is disruption free. The objective is to incrementally wake up sleeping links upon the detection of increased traffic demand. Unlike normal approaches of manipulating link weights or reverting to full topology in case of even minor network congestion and thereby sacrificing energy savings, our algorithm wakes up the minimum number of sleeping links to the network in order to handle this dynamicity. The performance of our algorithm was evaluated using the GEANT network topology and its traffic traces over a period of one week. According to our simulation results, up to almost 47% energy gains can be achieved without any obstruction to the network performance. Secondly, we show that the activation of a small number of sleeping links is still sufficient to cope with the observed traffic surge. Document type: Part of book or chapter of boo

Traffic engineering in dynamic optical networks

Traffic Engineering (TE) refers to all the techniques a Service Provider employs to improve the efficiency and reliability of network operations. In IP over Optical (IPO) networks, traffic coming from upper layers is carried over the logical topology defined by the set of established lightpaths. Within this framework then, TE techniques allow to optimize the configuration of optical resources with respect to an highly dynamic traffic demand. TE can be performed with two main methods: if the demand is known only in terms of an aggregated traffic matrix, the problem of automatically updating the configuration of an optical network to accommodate traffic changes is called Virtual Topology Reconfiguration (VTR). If instead the traffic demand is known in terms of data-level connection requests with sub-wavelength granularity, arriving dynamically from some source node to any destination node, the problem is called Dynamic Traffic Grooming (DTG). In this dissertation new VTR algorithms for load balancing in optical networks based on Local Search (LS) techniques are presented. The main advantage of using LS is the minimization of network disruption, since the reconfiguration involves only a small part of the network. A comparison between the proposed schemes and the optimal solutions found via an ILP solver shows calculation time savings for comparable results of network congestion. A similar load balancing technique has been applied to alleviate congestion in an MPLS network, based on the efficient rerouting of Label-Switched Paths (LSP) from the most congested links to allow a better usage of network resources. Many algorithms have been developed to deal with DTG in IPO networks, where most of the attention is focused on optimizing the physical resources utilization by considering specific constraints on the optical node architecture, while very few attention has been put so far on the Quality of Service (QoS) guarantees for the carried traffic. In this thesis a novel Traffic Engineering scheme is proposed to guarantee QoS from both the viewpoint of service differentiation and transmission quality. Another contribution in this thesis is a formal framework for the definition of dynamic grooming policies in IPO networks. The framework is then specialized for an overlay architecture, where the control plane of the IP and optical level are separated, and no information is shared between the two. A family of grooming policies based on constraints on the number of hops and on the bandwidth sharing degree at the IP level is defined, and its performance analyzed in both regular and irregular topologies. While most of the literature on DTG problem implicitly considers the grooming of low-speed connections onto optical channels using a TDM approach, the proposed grooming policies are evaluated here by considering a realistic traffic model which consider a Dynamic Statistical Multiplexing (DSM) approach, i.e. a single wavelength channel is shared between multiple IP elastic traffic flows

Survey of Consistent Network Updates

Computer networks have become a critical infrastructure. Designing dependable computer networks however is challenging, as such networks should not only meet strict requirements in terms of correctness, availability, and performance, but they should also be flexible enough to support fast updates, e.g., due to a change in the security policy, an increasing traffic demand, or a failure. The advent of Software-Defined Networks (SDNs) promises to provide such flexiblities, allowing to update networks in a fine-grained manner, also enabling a more online traffic engineering. In this paper, we present a structured survey of mechanisms and protocols to update computer networks in a fast and consistent manner. In particular, we identify and discuss the different desirable update consistency properties a network should provide, the algorithmic techniques which are needed to meet these consistency properties, their implications on the speed and costs at which updates can be performed. We also discuss the relationship of consistent network update problems to classic algorithmic optimization problems. While our survey is mainly motivated by the advent of Software-Defined Networks (SDNs), the fundamental underlying problems are not new, and we also provide a historical perspective of the subject