As redes ópticas têm evoluído de forma contínua dentro de um paradigma de aumento das taxas de transmissão e extensão dos enlaces, devido à demanda crescente de banda em função do crescimento do tráfego da Internet. Além disso, atualmente, diversas propostas vêm sendo implementadas visando torná-las mais dinâmicas e flexíveis. Uma destas propostas que atualmente está no âmbito de pesquisa e desenvolvimento refere-se às redes ópticas definidas por software (Software Defined Optical Network, SDON). Nas SDONs, o plano de controle é desacoplado do plano de encaminhamento de dados possibilitando que controladores remotos configurem em tempo real diversos parâmetros dos canais ópticos, tais como a taxa de transmissão, o formato de modulação, a largura do espectro, entre outros. Nestas redes, o sistema de controle torna-se bastante complexo, uma vez que diversos parâmetros têm que ser ajustados de forma dinâmica e autônoma, ou seja, com a mínima intervenção humana. O emprego de técnicas de inteligência computacional em tal controle possibilita a configuração autônoma dos parâmetros dos equipamentos com base em dados coletados por monitores de rede e o aprendizado, a partir de eventos passados, visando a otimização do desempenho da rede. Esta arquitetura de controle constitui um novo paradigma na evolução das redes ópticas, as denominadas Redes Ópticas Cognitivas. A escolha de uma técnica de inteligência computacional adequada para tomada de decisão em redes ópticas é importante para se obter vantagens no uso da cognição. Esta técnica deve possibilitar o aprendizado e ainda minimizar a complexidade computacional, uma vez que a configuração dos parâmetros da rede deve ocorrer em tempo real. Neste contexto, esta tese investiga o uso do algoritmo de agrupamento Fuzzy C-Means (FCM) para aprendizado e tomada de decisão em redes ópticas flexíveis de próxima geração. FCM possibilita a geração automática de regras com base na experiência adquirida no meio de operação (aprendizado) e a tomada de decisão a partir destas regras. Uma comparação de desempenho entre os algoritmos FCM e CBR (Case-Based Reasoning) é apresentada. O algoritmo CBR foi escolhido para esta comparação devido a ter sido utilizado recentemente, com sucesso, em redes ópticas cognitivas. Por fim, um conceito de rede óptica cognitiva é apresentado. / Optical networks have evolved continuously increasing the transmission rate and the extension of links due to the increased bandwidth consuming. Moreover, currently, several proposals are under development to make the next generation optical network more dynamic and flexible. The term \"flexible\" refers to the ability of dynamically adjust the parameters of the optical network such as modulation format, transmission rate, optical bandwidth and others, according with the quality of transmission of each lightpath. In this scenario, a Software Defined Optical Network (SDON) emerges as a new optical network paradigm, where the control plane is decoupled from the data plane, enabling remote controllers to configure network equipment from different hardware vendors, which allows a degree of software programmability to the network. In SDON, the control plane needs to include functionalities to operate autonomously, i.e, with minimal human intervention. The use of the computational intelligence techniques in such control plane enables the autonomous operation and learning based on past events, in order to optimize the network performance. This architecture represents a new paradigm in the evolution of optical networks, resulting in so-called Cognitive Optical Networks. The choice of a computational intelligence technique for learning and decisionmaking in such optical networks is essential to bring advantages with the use of cognition. This technique should minimize the computational complexity, since the configuration of the network parameters must occur in real time.In this context, this thesis investigates the use of Fuzzy C-Means clustering algorithm (FCM) for learning and decision-making in the software defined optical networks context. FCM enables the automatic generation of rules, based on the experience gained during the network operation. Then, these rules are used by the control plane to take decisions about the lightpaths\' configuration. A comparison of performance between the FCM and the CBR (Case-Based Reasoning) algorithm. CBR algorithm was chosen because it has been successfully used in cognitive optical networks. Finally, we propose a concept for optical cognitive network.

Parmi les architectures orientées contenu, l'architecture NDN (Named-Data Networking) a su agréger la plus importante communauté de chercheurs et est la plus aboutie pour un Internet du futur. Dans le cadre de l'architecture NDN, au cours de ce doctorat, nous nous sommes concentrés sur les mécanismes de routage adaptés à cette nouvelle vision du réseau. En effet, la capacité à acheminer une requête vers la destination est fondamentale pour qu'une architecture réseau soit fonctionnelle et cette problématique avait été très peu étudiée jusqu'alors. Ainsi, dans ce manuscrit, nous proposons le protocole de routage SRSC (SDN-based Routing Scheme for CCN/NDN), qui repose sur l'utilisation du paradigme des réseaux logiciels (Software-Defined Networks\\, SDN). SRSC utilise un contrôleur capable de gérer le plan de contrôle du réseau NDN. En centralisant l'ensemble des informations telles que la topologie du réseau, la localisation des différents contenus et le contenu des mémoires cache des nœuds du réseau, le contrôleur va pouvoir établir la meilleure route pour acheminer les requêtes vers le contenu. SRSC permet également un routage de type anycast, c'est à dire qu'il permet d'acheminer les requêtes vers le nœud le plus proche qui dispose des données, permettant d'optimiser la distribution des requêtes dans le réseau et de répartir la charge parmi tous les nœuds. De plus, SRSC utilise uniquement les messages Interest et Data de l'architecture NDN et tient son originalité du fait qu'il s'affranchit complètement de l'infrastructure TCP/IP existante. Dans un premier temps, SRSC a été évalué via simulation avec le logiciel NS-3 où nous l'avons comparé à la méthode d'inondation des requêtes, appelée flooding, initialement proposée par NDN. SRSC a ensuite été implanté dans NDNx, l'implantation open source de l'architecture NDN, puis déployé sur notre testbed utilisant la technologie Docker. Ce testbed permet de virtualiser des nœuds NDN et d'observer un réel déploiement de cette architecture réseau à large échelle. Nous avons ainsi évalué les performances de notre protocole SRSC sur notre testbed virtualisé et nous l'avons comparé au protocole NLSR, (Named-Data Link State Routing Protocol), le protocole de routage du projet NDN / Internet is a mondial content network and its use grows since several years. Content delivery such as P2P or video streaming generates the main part of the Internet traffic and Named Data Networks (NDN) appear as an appropriate architecture to satisfy the user needs. Named-Data Networking is a novel clean-slate architecture for Future Internet. It has been designed to deliver content at large scale and integrates several features such as in-network caching, security, multi-path. However, the lack of scalable routing scheme is one of the main obstacles that slow down a large deployment of NDN at an Internet-scale. As it relies on content names instead of host address, it cannot reuse the traditional routing scheme on the Internet. In this thesis, we propose to use the Software-Defined Networking (SDN) paradigm to decouple data plane and control plane and present SRSC, a new routing scheme for NDN based on SDN paradigm. Our solution is a clean-slate approach, using only NDN messages and the SDN paradigm. We implemented our solution into the NS-3 simulator and perform extensive simulations of our proposal. SRSC show better performances than the flooding scheme used by default in NDN. We also present a new NDN testbed and the implementation of our protocol SRSC, a Controlled-based Routing Scheme for NDN. We implemented SRSC into NDNx, the NDN implementation, and deployed it into a virtual environment through Docker. Our experiments demonstrate the ability of our proposal to forward Interest, while keeping a low computation time for the Controller and low delay to access Content. Moreover, we propose a solution to easily deploy and evaluate NDN network, and we compare SRSC with NLSR, the current routing protocol used in NDNx

Given the ever increasing reliance of today’s society on ubiquitous wireless access, the paradigm of dynamic spectrum access (DSA) as been proposed and implemented for utilizing the limited wireless spectrum more efficiently. Orthogonal frequency division multiplexing (OFDM) is growing in popularity for adoption into wireless services employing DSA frame- work, due to its high bandwidth efficiency and resiliency to multipath fading. While these advantages have been proven for many wireless applications, including LTE-Advanced and numerous IEEE wireless standards, one potential drawback of OFDM or its non-contiguous variant, NC-OFDM, is that it exhibits high peak-to-average power ratios (PAPR), which can induce in-band and out-of-band (OOB) distortions when the peaks of the waveform enter the compression region of the transmitter power amplifier (PA). Such OOB emissions can interfere with existing neighboring transmissions, and thereby severely deteriorate the reliability of the DSA network. A performance-enhancing digital pre-distortion (DPD) technique compensating for PA and in-phase/quadrature (I/Q) modulator distortions is proposed in this dissertation. Al- though substantial research efforts into designing DPD schemes have already been presented in the open literature, there still exists numerous opportunities to further improve upon the performance of OOB suppression for NC-OFDM transmission in the presence of RF front-end impairments. A set of orthogonal polynomial basis functions is proposed in this dissertation together with a simplified joint DPD structure. A performance analysis is presented to show that the OOB emissions is reduced to approximately 50 dBc with proposed algorithms employed during NC-OFDM transmission. Furthermore, a novel and intuitive DPD solution that can minimize the power regrowth at any pre-specified frequency in the spurious domain is proposed in this dissertation. Conventional DPD methods have been proven to be able to effectively reduce the OOB emissions that fall on top of adjacent channels. However more spectral emissions in more distant frequency ranges are generated by employing such DPD solutions, which are potentially in violation of the spurious emission limit. At the same time, the emissions in adjacent channel must be kept under the OOB limit. To the best of the author’s knowledge, there has not been extensive research conducted on this topic. Mathematical derivation procedures of the proposed algorithm are provided for both memoryless nonlinear model and memory-based nonlinear model. Simulation results show that the proposed method is able to provide a good balance of OOB emissions and emissions in the far out spurious domain, by reducing the spurious emissions by 4-5 dB while maintaining the adjacent channel leakage ratio (ACLR) improvement by at least 10 dB, comparing to the PA output spectrum without any DPD.

Cloud Infrastructure-as-a-Service (IaaS) is a form of utility computing which has emerged with the recent innovations in the service computing and data communication technologies. Regardless of the fact that IaaS is attractive for application service providers, satisfying user requests while ensuring cloud operational objectives is a complicated task that raises several resource management challenges. Among these challenges, limited controllability over network services delivered to cloud consumers is prominent in single datacenter cloud environments. In addition, the lack of seamless service migration and optimization, poor infrastructure utilization, and unavailability of efficient fault tolerant techniques are noteworthy challenges in geographically distributed datacenter clouds. Initially in this thesis, a datacenter resource management framework is presented to address the challenge of limited controllability over cloud network traffic. The proposed framework integrates network virtualization functionalities offered by software defined networking (SDN) into cloud ecosystem. To provide rich traffic control features to IaaS consumers, control plane virtualization capabilities offered by SDN have been employed. Secondly, a quality of service (QoS) aware seamless service migration and optimization framework has been proposed in the context of geo-distributed datacenters. Focus has been given to a mobile end-user scenario where frequent cloud service migrations are required to mitigate QoS violations. Finally, an SDN-based dynamic fault restoration scheme and a shared backup-based fault protection scheme have been proposed. The fault restoration has been achieved by introducing QoS-aware reactive and shared risk link group-aware proactive path computation algorithms. Shared backup protection has been achieved by optimizing virtual and backup link embedding through a novel integer linear programming approach. The proposed solutions significantly improve bandwidth utilization in inter-datacenter networks while recovering from substrate link failures.

This is a Masters student Final Dissertation / In this project, two tests were performed. On the first test, Mininet-WiFi was used to simulate a Software Defined Network to demonstrate Mininet-WiFi’ s ability to be used as the Software Defined Network emulator which can also be integrated to the existing network using a Network Virtualized Function (NVF). A typical organization’s computer network was simulated which consisted of a website hosted on the LAMP (Linux, Apache, MySQL, PHP) virtual machine, and an F5 application delivery controller (ADC) which provided load balancing of requests sent to the web applications. A website page request was sent from the virtual stations inside Mininet-WiFi. The request was received by the application delivery controller, which then used round robin technique to send the request to one of the web servers on the LAMP virtual machine. The web server then returned the requested website to the requesting virtual stations using the simulated virtual network. The significance of these results is that it presents Mininet-WiFi as an emulator, which can be integrated into a real programmable networking environment offering a portable, cost effective and easily deployable testing network, which can be run on a single computer. These results are also beneficial to modern network deployments as the live network devices can also communicate with the testing environment for the data center, cloud and mobile provides. On the second test, a Software Defined Network was created in Mininet using python script. An external interface was added to enable communication with the network outside of Mininet. The amazon web services elastic computing cloud was used to host an OpenDaylight controller. This controller is used as a control plane device for the virtual switch within Mininet. In order to test the network, a webserver hosted on the Emulated Virtual Environment – Next Generation (EVENG) software is connected to Mininet. EVE-NG is the Emulated Virtual Environment for networking. It provides tools to be able to model virtual devices and interconnect them with other virtual or physical devices. The OpenDaylight controller was able to create the flows to facilitate communication between the hosts in Mininet and the webserver in the real-life network / The University of South Africa The University of Johannesburg / College of Engineering, Science and Technology

Based on different sampling theorem, for example classic Shannon’s sampling theorem and Papoulis’ generalized sampling theorem, signals are processed by the sampling devices without loss of information. As an interface between radio receiver front-ends and digital signal processing blocks, sampling devices play a dominant role in digital radio communications. Under the concept of Software Defined Radio (SDR), radio systems are going through the second evolution that mixes analog, digital and software technologies in modern radio designs. One design goal of SDR is to put the A/D converter as close as possible to the antenna. BandPass Sampling (BPS) enables one to have an interface between the RF or the higher IF signal and the A/D converter, and it might be a solution to SDR. However, three sources of performance degradation present in BPS systems, harmful signal spectral overlapping, noise aliasing and sampling timing jitter, hinder the conventional BPS theory from practical circuit implementations. In this thesis work, Generalized Quadrature BandPass Sampling (GQBPS) is first invented and comprehensively studied with focus on the noise aliasing problem. GQBPS consists of both BPS and FIR filtering that can use either real or complex coefficients. By well-designed FIR filtering, GQBPS can also perform frequency down-conversion in addition to noise aliasing reduction. GQBPS is a nonuniform sampling method in most cases. With respect to real circuit implementations, uniform sampling is easier to be realized compared to nonuniform sampling. GQBPS has been also extended to Generalized Uniform BandPass Sampling (GUBPS). GUBPS shares the same property of noise aliasing suppression as GQBPS besides that the samples are uniformly spaced. Due to the moving average operation of FIR filtering, the effect of sampling jitter is also reduced to a certain degree in GQBPS and GUBPS. By choosing a suitable sampling rate, harmful signal spectral overlapping can be avoided. Due to the property of quadrature sampling, the “self image” problem caused by I/Q mismatches is eliminated. Comprehensive theoretical analyses and program simulations on GQBPS and GUBPS have been done based on a general mathematic model. Circuit architecture to implementing GUBPS in Switched-Capacitor circuit technique has been proposed and analyzed. To improve the selectivity at the sampling output, FIR filtering is extended by adding a 1st order complex IIR filter in the implementation. GQBPS and GUBPS operate in voltage-mode. Besides voltage sampling, BPS can also be realized by charge sampling in current-mode. Most other research groups in this area are focusing on bandpass charge sampling. However, the theoretical analysis shows that our GQBPS and GUBPS in voltage mode are more efficient to suppress noise aliasing as compared to bandpass charge sampling with embedded filtering. The aliasing bands of sampled-data spectrum are always weighted by continuous-frequency factors for bandpass charge sampling with embedded filtering while discrete-frequency factors for GQBPS and GUBPS. The transmission zeros of intrinsic filtering will eliminate the corresponding whole aliasing bands of both signal and noise in GQBPS and GUBPS, while it will only cause notches at a limited set of frequencies in bandpass charge sampling. In addition, charge sampling performs an intrinsic continuous-time sinc function that always includes lowpass filtering. This is a drawback for a bandpass input signal. / QC 20100921

Software radios (SWR) have been proposed for wireless communication systems to enable them to operate according to incompatible wireless communication standards by implementing most analog functions in the digital section on software-reprogrammable hardware. However, this significantly increases the required computations for SWR functionality, mainly because of the digital front-end computationally intensive filtering functions, such as sample rate conversion (SRC), channelization, and equalization. For increasing the computational efficiency of SWR systems, two new SRC methods with better performance than conventional SRC methods are presented. In the first SRC method, we modify the conventional CIC filters to enable them to perform SRC on slightly oversampled signals efficiently. We also describe a SRC method with high efficiency for SRC by factors greater than unity at which SRC in SWR systems may be computationally demanding. This SRC method efficiently increases the sample rate of wideband signals, especially in SWR base station transmitters, by applying Lagrange interpolation for evaluating output samples hierarchically using a low-rate signal that is computed with low cost from the input signal. A new channelizer/synthesizer is also developed for extracting/combining frequency multiplexed channels in SWR transceivers. The efficiency of this channelizer/synthesizer, which uses modulated perfect reconstruction (PR) filter banks, is higher than polyphase filter banks (when applicable) for processing few channels, and significantly higher than discrete filter banks for processing any number of variable-bandwidth channels where polyphase filter banks are inapplicable. Because the available methods for designing modulated PR filter banks are inapplicable due to the required number of subchannels and stopband attenuation of the prototype filters, a new design method for these filter banks is introduced. This method is reliable and significantly faster than the existing methods. Modulated PR filter banks are also considered for implementing a frequency-domain block blind equalizer capable of equalizing SWR signals transmitted though channels with long impulse responses and severe intersymbol interference (ISI). This blind equalizer adapts by using separate sets of weights to correct for the magnitude and phase distortion of the channel. The adaptation of this blind equalizer is significantly more reliable and its computational requirements increase at a lower rate compared to conventional time-domain equalizers making it efficient for equalizing long channels that exhibit severe ISI.

This dissertation presents novel Harmonic Rejection (HR) Mixer architectures to obtain a high level of harmonic rejection. This is achieved by reducing the sensitivity to mismatches in devices operating at high frequencies. Consequently, the HR performance for this mixer architecture is primarily determined by resistor and capacitor matching at low intermediate frequencies (IF). Since large resistor areas can be used at relatively less power penalty in the low frequency IF section, superior HR performance is realized. A design fabricated in 110 nm CMOS process, rejects up to the fi rst 14 local oscillator (LO) harmonics and achieves 3rd, 5th and 7th HR ratios in excess of 52, 54 and 55 dB respectively, without any calibration or trimming. This mixer architecture also rejects flicker noise, has improved image rejection (IR) and second-order input-intercept-point (IIP2) performance. By using a clock N times the desired LO frequency, this scheme rejects the (N-1)th LO harmonic only by an amount of 20log(N-1) dB. A new technique is presented that enables better HR for the (N-1)th harmonic while preserving the level of rejection for other harmonics. This mixer fabricated in 55 nm standard CMOS process has a programmable number of 8, 10, 12 or 14 mixer phases and achieves an improvement of 29 dB for the (N-1)th harmonic while achieving 52 dB of rejection for the 3rd harmonic. It also rejects flicker noise and has an IIP2 performance of 68 dBm. The mixers presented in this dissertation set the state-of-the-art in HR performance for single-stage mixers with configurable number of phases without using any calibration or trimming. / text

The functionality provided by mobile devices such as cellular phones and tablets continues to increase over the years, with integration of an ever larger number of wireless standards within a given device. In several of these designs, each standard supported by a device requires its own IC receiver to be mounted on the device’s PCB. In multistandard and multimode radios, it is desirable to integrate all receivers onto the same IC as the digital processors for the standards, in order to reduce device cost and size. Ideally all the receivers should also share a single signal chain. Since each standard has its own requirements for linearity and noise figure, and each standard operates at a different RF carrier frequency, implementing such a receiver is very challenging. Such a receiver could be theoretically implemented using a broadband mixing receiver or by direct sampling by a high-speed analog-to-digital converter (ADC). Broadband mixing requires the use of a harmonic rejection mixer (HRM) or tunable band pass filter to remove harmonic mixing effects, which in the past have suffered from a large primary clock tuning range and high power consumption. However, direct sampling of the RF input requires a high-speed ADC with large dynamic range which is typically limited by clock timing skew, clock jitter, or harmonic folding. In this dissertation, techniques for programmable broadband radio receivers are proposed. A local oscillator (LO) synthesis method within HRMs is proposed which reduces the required primary clock tuning range in broadband receivers. The LO synthesis method is implemented in 130-nm CMOS. A clocking technique is introduced within the two-stage HRM, which helps in achieving state-of-the-art harmonic rejection performance without calibration or harmonic filtering. An analog frequency synthesis based broadband channelizer is proposed using the LO synthesis method which is capable of channelizing a broadband input using a single mixing stage and primary clock frequency. A frequency-folded ADC architecture is proposed which enables high-speed sampling with high dynamic range. A receiver based on the frequency-folded ADC architecture is implemented in 65-nm CMOS and achieves a sample rate of 2-GS/s, a mean 49-dB SNDR, and 8.5-dB NF. / text

We present the design, development, and test of three novel, distinct automatic target recognition (ATR) systems for the recognition of airplanes and, more specifically, non-cooperative airplanes, i.e. airplanes that do not provide information when interrogated, in the framework of passive bistatic radar systems. Passive bistatic radar systems use one or more illuminators of opportunity (already present in the field), with frequencies up to 1 GHz for the transmitter part of the systems considered here, and one or more receivers, deployed by the persons managing the system, and not co-located with the transmitters. The sole source of information are the signal scattered on the airplane and the direct-path signal that are collected by the receiver, some basic knowledge about the transmitter, and the geometrical bistatic radar configuration. The three distinct ATR systems that we built respectively use the radar images, the bistatic complex radar cross-section (BS-RCS), and the bistatic radar cross-section (BS-RCS) of the targets. We use data acquired either on scale models of airplanes placed in an anechoic, electromagnetic chamber or on real-size airplanes using a bistatic testbed consisting of a VOR transmitter and a software-defined radio (SDR) receiver, located near Orly airport, France. We describe the radar phenomenology pertinent for the problem at hand, as well as the mathematical underpinnings of the derivation of the bistatic RCS values and of the construction of the radar images.For the classification of the observed targets into pre-defined classes, we use either extremely randomized trees or subspace methods. A key feature of our approach is that we break the recognition problem into a set of sub-problems by decomposing the parameter space, which consists of the frequency, the polarization, the aspect angle, and the bistatic angle, into regions. We build one recognizer for each region. We first validate the extra-trees method on the radar images of the MSTAR dataset, featuring ground vehicles. We then test the method on the images of the airplanes constructed from data acquired in the anechoic chamber, achieving a probability of correct recognition up to 0.99.We test the subspace methods on the BS-CRCS and on the BS-RCS of the airplanes extracted from the data acquired in the anechoic chamber, achieving a probability of correct recognition up to 0.98, with variations according to the frequency band, the polarization, the sector of aspect angle, the sector of bistatic angle, and the number of (Tx,Rx) pairs used. The ATR system deployed in the field gives a probability of correct recognition of $0.82$, with variations according to the sector of aspect angle and the sector of bistatic angle.