On the offline physical layer impairment aware RWA algorithms in transparent optical networks: state-of-the-art and beyond

In transparent optical networks with no regeneration, the problem of capacity allocation to traffic demands is called "Roting and Wavelength Assignment". Much work on this topic recently has focused on the dynamic case, whereby demands arrive and must be served in real-time. In addition, due to lack of regeneration, physical impairments accumulate as light propagates and QoT may become inappropiate (e.g., too high Bit Error Rate). Considering the physical layer impairments in the network planning phase gives rise to a class of RWA algorithms: offline Physical Layer Impairment Aware- (PLIA-)RWA. This paper makes a survey of such algorithms, proposes a taxonomy, and a comparison between these algorithms for common metrics. We also propose a novel offline PLIA-RWA algorithm, called POLIO-RWA, and show through simulations that it decreases blocking rate compared with other PLIA-RWA algorithms.Postprint (published version

Attack-Aware Routing and Wavelength Assignment of Scheduled Lightpath Demands

In Transparent Optical Networks, tra c is carried over lightpaths, creating a vir- tual topology over the physical connections of optical bers. Due to the increasingly high data rates and the vulnerabilities related to the transparency of optical network, security issues in transparent wavelength division multiplexing (WDM) optical net- works have become of great signi cance to network managers. In this thesis, we intro- duce some basic concepts of transparent optical network, the types and circumstances of physical-layer attacks and analysis of related work at rst. In addition, based on the previous researches, we present a novel approach and several new objective cri- terions for the problem of attack-aware routing and wavelength assignment. Integer Linear Programming (ILP) formulation is used to solve the routing sub-problem with the objective to minimize the disruption of physical-layer attack as well as to opti- mize Routing and Wavelength Assignment (RWA) of scheduled transparent optical network

Heuristic for Lowering Electricity Costs for Routing in Optical Data Center Networks

Optical data centers consume a large quantity of energy and the cost of that energy has a significant contribution to the operational cost in data centers. The amount of electricity consumption in data centers and their related costs are increasing day by day. Data centers are geographically distributed all around the continents and the growing numbers of data replicas have made it possible to find more cost effective network routing. Besides flat-rate prices, today, there are companies which offers real-time pricing. In order to address the energy consumption cost problem, we propose an energy efficient routing scheme to find least cost path to the replicas based on real-time pricing model called energy price aware routing (EPAR). Our research considers anycast data transmission model to find the suitable replica as well as the fixed window traffic allocation model for demand request to reduce the energy consumption cost of data center networks

Survivability aspects of future optical backbone networks

In huidige glasvezelnetwerken kan een enkele vezel een gigantische hoeveelheid data dragen, ruwweg het equivalent van 25 miljoen gelijktijdige telefoongesprekken. Hierdoor zullen netwerkstoringen, zoals breuken van een glasvezelkabel, de communicatie van een groot aantal eindgebruikers verstoren. Netwerkoperatoren kiezen er dan ook voor om hun netwerk zo te bouwen dat zulke grote storingen automatisch opgevangen worden. Dit proefschrift spitst zich toe op twee aspecten rond de overleefbaarheid in toekomstige optische netwerken. De eerste doelstelling die beoogd wordt is het tot stand brengen vanrobuuste dataverbindingen over meerdere netwerken. Door voldoende betrouwbare verbindingen tot stand te brengen over een infrastructuur die niet door een enkele entiteit wordt beheerd kan men bv. weredwijd Internettelevisie van hoge kwaliteit aanbieden. De bestudeerde oplossing heeft niet enkel tot doel om deze zeer betrouwbare verbinding te berekenen, maar ook om dit te bewerkstelligen met een minimum aan gebruikte netwerkcapaciteit. De tweede doelstelling was om een antwoord te formuleren om de vraag hoe het toepassen van optische schakelsystemen gebaseerd op herconfigureerbare optische multiplexers een impact heeft op de overleefbaarheid van een optisch netwerk. Bij lagere volumes hebben optisch geschakelde netwerken weinig voordeel van dergelijke gesofistikeerde methoden. Elektronisch geschakelde netwerken vertonen geen afhankelijkheid van het datavolume en hebben altijd baat bij optimalisatie

Security-Aware RWA for Dynamic Traffic Using Path Protection In WDM Networks

Security and attack management have become the prime concern for the network operators due to high data transfer rates and vulnerabilities associated with transparency in WDM networks. In the recent years, there is a substantial increase in perception to develop suitable mechanisms for subduing the adverse effects of malicious attacks such as high power jamming and tapping attacks.In transparent optical networks (TONs) traffic is carried over the optical fibers in the form of signals called lightpaths, creating a virtual topology over the physical interconnections of an optical fiber. This allows an exchange of an enormous amount of data at a very high speed. A fault or an attack on the network can lead to data tampering and data loss. Unlike faults, malicious attacks may not be localized and we cannot handle them with the standard fault-tolerance mechanisms in WDM networks. The Routing and Wavelength Assignment (RWA) problem assigns appropriate routes and wavelengths to all associated lightpaths in the network. Most the researchers considered the static traffic model, where the network requests (i.e. lightpaths to be established) are known in advance and last over long durations. In this thesis, we are solving the security-aware problem for dynamic requests by using protection strategy known as dedicated path protection (DPP). In the dynamic model, lightpaths are generated on-demand, and RWA must be performed based on available resources that are not being used by ongoing lightpaths. We propose an Integer linear programming (ILP) formulation to maximize requests satisfaction and reducing the disruption in the network due to malicious attacks (In-band and out-band)

Quality of Transmission Aware Optical Networking Using Enhanced Gaussian Noise Model

We present a new joint routing, wavelength, and power allocation method for optical network planning. The introduced gradient-based convex optimization approach has a lower computational complexity, compared to common linear programming techniques, suitable for both static as well as time-critical dynamic network planning with fast convergence requirement. The proposed scheme takes physical-layer impairments into account, using the enhanced Gaussian noise nonlinear model. In contrast to methods exploiting the theoretical full link spectrum utilization assumption (fully occupied fiber-optic C-hand spectrum), we focus on maximizing the network achievable rate and minimum signal-to-noise ratio (SNR) margin of networks with partial spectrum utilization in their links, relevant to the majority of empirical metro network scenarios. According to numerical results, the network achievable rate can be improved around 17% by performing power optimization over the individual launch power of network lightpaths compared to optimizing a single flat (equal) launch power for all the lightpaths. Moreover, the minimum SNR margin of the simulated network is improved by about 23 dB. Finally, it is observed that maximizing the network minimum SNR margin needs the launch power of each lightpath to be proportional to the total nonlinear interference noise efficiency influencing the lightpath

Characterization, design and re-optimization on multi-layer optical networks

L'augment de volum de tràfic IP provocat per l'increment de serveis multimèdia com HDTV o vídeo conferència planteja nous reptes als operadors de xarxa per tal de proveir transmissió de dades eficient. Tot i que les xarxes mallades amb multiplexació per divisió de longitud d'ona (DWDM) suporten connexions òptiques de gran velocitat, aquestes xarxes manquen de flexibilitat per suportar tràfic d’inferior granularitat, fet que provoca un pobre ús d'ample de banda. Per fer front al transport d'aquest tràfic heterogeni, les xarxes multicapa representen la millor solució. Les xarxes òptiques multicapa permeten optimitzar la capacitat mitjançant l'empaquetament de connexions de baixa velocitat dins de connexions òptiques de gran velocitat. Durant aquesta operació, es crea i modifica constantment una topologia virtual dinàmica gràcies al pla de control responsable d’aquestes operacions. Donada aquesta dinamicitat, un ús sub-òptim de recursos pot existir a la xarxa en un moment donat. En aquest context, una re-optimizació periòdica dels recursos utilitzats pot ser aplicada, millorant així l'ús de recursos. Aquesta tesi està dedicada a la caracterització, planificació, i re-optimització de xarxes òptiques multicapa de nova generació des d’un punt de vista unificat incloent optimització als nivells de capa física, capa òptica, capa virtual i pla de control. Concretament s'han desenvolupat models estadístics i de programació matemàtica i meta-heurístiques. Aquest objectiu principal s'ha assolit mitjançant cinc objectius concrets cobrint diversos temes oberts de recerca. En primer lloc, proposem una metodologia estadística per millorar el càlcul del factor Q en problemes d'assignació de ruta i longitud d'ona considerant interaccions físiques (IA-RWA). Amb aquest objectiu, proposem dos models estadístics per computar l'efecte XPM (el coll d'ampolla en termes de computació i complexitat) per problemes IA-RWA, demostrant la precisió d’ambdós models en el càlcul del factor Q en escenaris reals de tràfic. En segon lloc i fixant-nos a la capa òptica, presentem un nou particionament del conjunt de longituds d'ona que permet maximitzar, respecte el cas habitual, la quantitat de tràfic extra proveït en entorns de protecció compartida. Concretament, definim diversos models estadístics per estimar la quantitat de tràfic donat un grau de servei objectiu, i diferents models de planificació de xarxa amb l'objectiu de maximitzar els ingressos previstos i el valor actual net de la xarxa. Després de resoldre aquests problemes per xarxes reals, concloem que la nostra proposta maximitza ambdós objectius. En tercer lloc, afrontem el disseny de xarxes multicapa robustes davant de fallida simple a la capa IP/MPLS i als enllaços de fibra. Per resoldre aquest problema eficientment, proposem un enfocament basat en sobre-dimensionar l'equipament de la capa IP/MPLS i recuperar la connectivitat i el comparem amb la solució convencional basada en duplicar la capa IP/MPLS. Després de comparar solucions mitjançant models ILP i heurístiques, concloem que la nostra solució permet obtenir un estalvi significatiu en termes de costos de desplegament. Com a quart objectiu, introduïm un mecanisme adaptatiu per reduir l'ús de ports opto-electrònics (O/E) en xarxes multicapa sota escenaris de tràfic dinàmic. Una formulació ILP i diverses heurístiques són desenvolupades per resoldre aquest problema, que permet reduir significativament l’ús de ports O/E en temps molt curts. Finalment, adrecem el problema de disseny resilient del pla de control GMPLS. Després de proposar un nou model analític per quantificar la resiliència en topologies mallades de pla de control, usem aquest model per proposar un problema de disseny de pla de control. Proposem un procediment iteratiu lineal i una heurística i els usem per resoldre instàncies reals, arribant a la conclusió que es pot reduir significativament la quantitat d'enllaços del pla de control sense afectar la qualitat de servei a la xarxa.The explosion of IP traffic due to the increase of IP-based multimedia services such as HDTV or video conferencing poses new challenges to network operators to provide a cost-effective data transmission. Although Dense Wavelength Division Multiplexing (DWDM) meshed transport networks support high-speed optical connections, these networks lack the flexibility to support sub-wavelength traffic leading to poor bandwidth usage. To cope with the transport of that huge and heterogeneous amount of traffic, multilayer networks represent the most accepted architectural solution. Multilayer optical networks allow optimizing network capacity by means of packing several low-speed traffic streams into higher-speed optical connections (lightpaths). During this operation, a dynamic virtual topology is created and modified the whole time thanks to a control plane responsible for the establishment, maintenance, and release of connections. Because of this dynamicity, a suboptimal allocation of resources may exist at any time. In this context, a periodically resource reallocation could be deployed in the network, thus improving network resource utilization. This thesis is devoted to the characterization, planning, and re-optimization of next-generation multilayer networks from an integral perspective including physical layer, optical layer, virtual layer, and control plane optimization. To this aim, statistical models, mathematical programming models and meta-heuristics are developed. More specifically, this main objective has been attained by developing five goals covering different open issues. First, we provide a statistical methodology to improve the computation of the Q-factor for impairment-aware routing and wavelength assignment problems (IA-RWA). To this aim we propose two statistical models to compute the Cross-Phase Modulation variance (which represents the bottleneck in terms of computation time and complexity) in off-line and on-line IA-RWA problems, proving the accuracy of both models when computing Q-factor values in real traffic scenarios. Second and moving to the optical layer, we present a new wavelength partitioning scheme that allows maximizing the amount of extra traffic provided in shared path protected environments compared with current solutions. Specifically, we define several statistical models to estimate the traffic intensity given a target grade of service, and different network planning problems for maximizing the expected revenues and net present value. After solving these problems for real networks, we conclude that our proposed scheme maximizes both revenues and NPV. Third, we tackle the design of survivable multilayer networks against single failures at the IP/MPLS layer and WSON links. To efficiently solve this problem, we propose a new approach based on over-dimensioning IP/MPLS devices and lightpath connectivity and recovery and we compare it against the conventional solution based on duplicating backbone IP/MPLS nodes. After evaluating both approaches by means of ILP models and heuristic algorithms, we conclude that our proposed approach leads to significant CAPEX savings. Fourth, we introduce an adaptive mechanism to reduce the usage of opto-electronic (O/E) ports of IP/MPLS-over-WSON multilayer networks in dynamic scenarios. A ILP formulation and several heuristics are developed to solve this problem, which allows significantly reducing the usage of O/E ports in very short running times. Finally, we address the design of resilient control plane topologies in GMPLS-enabled transport networks. After proposing a novel analytical model to quantify the resilience in mesh control plane topologies, we use this model to propose a problem to design the control plane topology. An iterative model and a heuristic are proposed and used to solve real instances, concluding that a significant reduction in the number of control plane links can be performed without affecting the quality of service of the network