Design And Analysis Of Effective Routing And Channel Scheduling For Wavelength Division Multiplexing Optical Networks

Optical networking, employing wavelength division multiplexing (WDM), is seen as the technology of the future for the Internet. This dissertation investigates several important problems affecting optical circuit switching (OCS) and optical burst switching (OBS) networks. Novel algorithms and new approaches to improve the performance of these networks through effective routing and channel scheduling are presented. Extensive simulations and analytical modeling have both been used to evaluate the effectiveness of the proposed algorithms in achieving lower blocking probability, better fairness as well as faster switching. The simulation tests were performed over a variety of optical network topologies including the ring and mesh topologies, the U.S. Long-Haul topology, the Abilene high-speed optical network used in Internet 2, the Toronto Metropolitan topology and the European Optical topology. Optical routing protocols previously published in the literature have largely ignored the noise and timing jitter accumulation caused by cascading several wavelength conversions along the lightpath of the data burst. This dissertation has identified and evaluated a new constraint, called the wavelength conversion cascading constraint. According to this constraint, the deployment of wavelength converters in future optical networks will be constrained by a bound on the number of wavelength conversions that a signal can go through when it is switched all-optically from the source to the destination. Extensive simulation results have conclusively demonstrated that the presence of this constraint causes significant performance deterioration in existing routing and wavelength assignment (RWA) algorithms. Higher blocking probability and/or worse fairness have been observed for existing RWA algorithms when the cascading constraint is not ignored. To counteract the negative side effect of the cascading constraint, two constraint-aware routing algorithms are proposed for OCS networks: the desirable greedy algorithm and the weighted adaptive algorithm. The two algorithms perform source routing using link connectivity and the global state information of each wavelength. Extensive comparative simulation results have illustrated that by limiting the negative cascading impact to the minimum extent practicable, the proposed approaches can dramatically decrease the blocking probability for a variety of optical network topologies. The dissertation has developed a suite of three fairness-improving adaptive routing algorithms in OBS networks. The adaptive routing schemes consider the transient link congestion at the moment when bursts arrive and use this information to reduce the overall burst loss probability. The proposed schemes also resolve the intrinsic unfairness defect of existing popular signaling protocols. The extensive simulation results have shown that the proposed schemes generally outperform the popular shortest path routing algorithm and the improvement could be substantial. A two-dimensional Markov chain analytical model has also been developed and used to analyze the burst loss probabilities for symmetrical ring networks. The accuracy of the model has been validated by simulation. Effective proactive routing and preemptive channel scheduling have also been proposed to address the conversion cascading constraint in OBS environments. The proactive routing adapts the fairness-improving adaptive routing mentioned earlier to the environment of cascaded wavelength conversions. On the other hand, the preemptive channel scheduling approach uses a dynamic priority for each burst based on the constraint threshold and the current number of performed wavelength conversions. Empirical results have proved that when the cascading constraint is present, both approaches would not only decrease the burst loss rates greatly, but also improve the transmission fairness among bursts with different hop counts to a large extent

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

Artificial intelligence (AI) methods in optical networks: A comprehensive survey

Producción CientíficaArtificial intelligence (AI) is an extensive scientific discipline which enables computer systems to solve problems by emulating complex biological processes such as learning, reasoning and self-correction. This paper presents a comprehensive review of the application of AI techniques for improving performance of optical communication systems and networks. The use of AI-based techniques is first studied in applications related to optical transmission, ranging from the characterization and operation of network components to performance monitoring, mitigation of nonlinearities, and quality of transmission estimation. Then, applications related to optical network control and management are also reviewed, including topics like optical network planning and operation in both transport and access networks. Finally, the paper also presents a summary of opportunities and challenges in optical networking where AI is expected to play a key role in the near future.Ministerio de Economía, Industria y Competitividad (Project EC2014-53071-C3-2-P, TEC2015-71932-REDT

GMPLS-OBS interoperability and routing acalability in internet

The popularization of Internet has turned the telecom world upside down over the last two decades. Network operators, vendors and service providers are being challenged to adapt themselves to Internet requirements in a way to properly serve the huge number of demanding users (residential and business). The Internet (data-oriented network) is supported by an IP packet-switched architecture on top of a circuit-switched, optical-based architecture (voice-oriented network), which results in a complex and rather costly infrastructure to the transport of IP traffic (the dominant traffic nowadays). In such a way, a simple and IP-adapted network architecture is desired. From the transport network perspective, both Generalized Multi-Protocol Label Switching (GMPLS) and Optical Burst Switching (OBS) technologies are part of the set of solutions to progress towards an IP-over-WDM architecture, providing intelligence in the control and management of resources (i.e. GMPLS) as well as a good network resource access and usage (i.e. OBS). The GMPLS framework is the key enabler to orchestrate a unified optical network control and thus reduce network operational expenses (OPEX), while increasing operator's revenues. Simultaneously, the OBS technology is one of the well positioned switching technologies to realize the envisioned IP-over-WDM network architecture, leveraging on the statistical multiplexing of data plane resources to enable sub-wavelength in optical networks. Despite of the GMPLS principle of unified control, little effort has been put on extending it to incorporate the OBS technology and many open questions still remain. From the IP network perspective, the Internet is facing scalability issues as enormous quantities of service instances and devices must be managed. Nowadays, it is believed that the current Internet features and mechanisms cannot cope with the size and dynamics of the Future Internet. Compact Routing is one of the main breakthrough paradigms on the design of a routing system scalable with the Future Internet requirements. It intends to address the fundamental limits of current stretch-1 shortest-path routing in terms of RT scalability (aiming at sub-linear growth). Although "static" compact routing works fine, scaling logarithmically on the number of nodes even in scale-free graphs such as Internet, it does not handle dynamic graphs. Moreover, as multimedia content/services proliferate, the multicast is again under the spotlight as bandwidth efficiency and low RT sizes are desired. However, it makes the problem even worse as more routing entries should be maintained. In a nutshell, the main objective of this thesis in to contribute with fully detailed solutions dealing both with i) GMPLS-OBS control interoperability (Part I), fostering unified control over multiple switching domains and reduce redundancy in IP transport. The proposed solution overcomes every interoperability technology-specific issue as well as it offers (absolute) QoS guarantees overcoming OBS performance issues by making use of the GMPLS traffic-engineering (TE) features. Keys extensions to the GMPLS protocol standards are equally approached; and ii) new compact routing scheme for multicast scenarios, in order to overcome the Future Internet inter-domain routing system scalability problem (Part II). In such a way, the first known name-independent (i.e. topology unaware) compact multicast routing algorithm is proposed. On the other hand, the AnyTraffic Labeled concept is also introduced saving on forwarding entries by sharing a single forwarding entry to unicast and multicast traffic type. Exhaustive simulation campaigns are run in both cases in order to assess the reliability and feasible of the proposals

Offset time-emulated architecture for optical burst switching-modelling and performance evaluation

L'evolució de les xarxes publiques de transport de dades destaca per el continu augment de la demanda de tràfic a la que estan sotmeses. La causa és la imparable popularització d'Internet i del seu ús per a tot tipus d'aplicacions. Les xarxes de commutació de ràfegues òptiques (OBS: Optical Bursts Switching) són una solució extraordinàriament prometedora per la pròxima generació de xarxes, tant per la flexibilitat que ofereixen com per el seu alt rendiment fruit de l'explotació de la multiplexació estadística en el domini òptic.Aquesta tesi presenta l'anàlisi, modelització i avaluació de les xarxes de commutació de ràfegues òptiques basades en l'emulació del temps de compensació (emulated offset time: E-OBS). El concepte d'E-OBS defineix una arquitectura de xarxa OBS per al transportar i commutar ràfegues òptiques en una xarxa troncal en la que, al contrari de l'arquitectura convencional (C-OBS) en la que el temps de compensació s'introdueix des dels nodes d'accés, el temps de compensació s'introdueix en cadascun dels nodes de la xarxa per mitjà d'un retardador de fibra addicional. L'arquitectura E-OBS permet superar algunes de les desavantatges inherents a arquitectures C-OBS, però la seva gran virtut és la compatibilitat amb les xarxes de commutació de circuits òptics (OCS: Optical Circuit Switching) actuals i les futures xarxes de commutació de paquets òptics (OPS: Optical Packet Switching), de manera que les xarxes OBS basades en una arquitectura E-OBS) poden facilitat enormement la transició de unes a les altres.A ala vista dels principals requeriments de disseny de les xarxes OBS, que són la resolució de contencions en el domini òptic, la provisió de qualitat de servei (QoS) i l'òptim encaminament de les ràfegues per tal de minimitzar la congestió de la xarxa, . en aquesta tesi es proposa un disseny de l'arquitectura E-OBS basada en (i) un mètode viable per a la provisió del temps de compensació, (ii) una qualitat alta global de servei, i (iii) un mecanisme d'encaminament que minimitzi congestió de xarxa.- La primera part d'aquesta tesi proporciona la informació documental necessària per al disseny d'E-OBS.- La segona part se centra en l'estudi de la funcionalitat i viabilitat de l'arquitectura E-OBS. S'introdueixen els principis d'operació d'E-OBS i s'identifiquen els principals esculls que presenten les arquitectures C-OBS i que deixen de ser-ho en una arquitectura E-OBS. Alguns d'aquests esculls són la dificultat d'utilitzar un algorisme d'encaminament amb rutes alternatives, la complexitat dels algoritmes de reserva de recursos i la seva falta d'equitat, la complexitat en la provisió de la QoS, etc. En aquesta segona part es constata que l'arquitectura E-OBS redueix la complexitat dels de reserva de recursos i es verifica la viabilitat d'operació i de funcionament de la provisió del tremps de compensació en aquesta arquitectura a partir de figures de comportament obtingudes amb retardadors de fibra comercialment disponibles.- La tercera part encara el problema de la provisió de la QoS. Primer s'hi revisen els conceptes bàsics de QoS així com els mecanismes de tractament de la QoS per a xarxes OBS fent-ne una comparació qualitativa i de rendiment de tots ells. Com a resultat s'obté que el mecanisme que presenta un millor comportament és el d'avortament de la transmissió de les ràfegues de més baixa prioritat quan aquestes col·lisionen amb una de prioritat més alta (es l'anomenat Burst Preemption mechanism), el qual en alguns casos presenta un problema de senyalització innecessària. Aquesta tercera part es conclou amb la proposta d'un mecanisme de finestra a afegir al esquema de Burst Preemption que només funciona sobre una arquitectura E-OBS i que soluciona aquest problema.- En la quarta part s'afronta el problema de l'encaminament en xarxes OBS. S'estudia el comportament dels algoritmes d'encaminament adaptatius, els aïllats amb rutes alternatives i els multicamí distribuïts, sobre xarxes E-OBS. A la vista dels resultats no massa satisfactoris que s'obtenen, es planteja una solució alternativa que es basa en model d'optimització no lineal. Es formulen i resolen dos models d'optimització per als algoritmes encaminament de font multicamí que redueixen notablement la congestió en les xarxes OBS.Finalment, aquesta tesi conclou que l'arquitectura E-OBS és factible, que és més eficient que la C-OBS, que proveeix eficaçment QoS, i que és capaç d'operar amb diverses estratègies d'encaminament i de reduir eficaçment la congestió de xarxa.The fact that the Internet is a packet-based connection-less network is the main driver to develop a data-centric transport network. In this context, the optical burst switching (OBS) technology is considered as a promising solution for reducing the gap between transmission and switching speeds in future networks.This thesis presents the analysis, modelling, and evaluation of the OBS network with Emulated offset-time provisioning (E-OBS). E-OBS defines an OBS network architecture to transport and switch optical data bursts in a core network. On the contrary to a conventional offset-time provisioning OBS (C-OBS) architecture, where a transmission offset time is introduced in the edge node, in an E-OBS network the offset time is provided in the core node by means of an additional fibre delay element. The architecture is motivated by several drawbacks inherent to C-OBS architectures. It should be pointed out that the E-OBS has not been studied intensively in the literature and this concept has been considered rather occasionally.Due to the limitations in optical processing and queuing, OBS networks need a special treatment so that they could solve problems typical of data-centric networks. Contention resolution in optical domain together with quality of service (QoS) provisioning for quality demanding services are, among other things, the main designing issues when developing OBS networks. Another important aspect is routing problem, which concerns effective balancing of traffic load so that to reduce burst congestion at overloaded links. Accounting for these requirements, the design objectives for the E-OBS architecture are (i) feasibility of offset-time provisioning, (ii) an overall high quality of service, and (iii) reduction of network congestion. These objectives are achieved by combining selected concepts and strategies, together with appropriate system design as well as network traffic engineering.The contributions in this thesis can be summarized as follows.- At the beginning, we introduce the principles of E-OBS operation and we demonstrate that C-OBS possesses many drawbacks that can be easily avoided in E-OBS. Some of the discussed issues are the problem of unfairness in resources reservation, difficulty with alternative routing, complexity of resources reservation algorithms, efficiency of burst scheduling, and complexity in QoS provisioning. The feasibility of E-OBS operation is investigated as well; in this context, the impact of congestion in control plane on OBS operation is studied. As a result, we confirm the feasibility of E-OBS operation with commercially available fibre delay elements.- Then, we provide both qualitative and quantitative comparison of the selected, most addressed in the literature, QoS mechanisms. As an outcome a burst preemption mechanism, which is characterized by the highest overall performance, is qualified for operating in E-OBS. Since the preemptive mechanism may produce the overbooking of resources in an OBS network we address this issue as well. We propose the preemption window mechanism to solve the problem. An analytical model of the mechanism legitimates correctness of our solution.- Finally, we concern with a routing problem - our routing objective is to help the contention resolution algorithms in the reduction of burst losses. We propose and evaluate two isolated alternative routing algorithms designed for labelled E-OBS networks. Then we study multi-path source routing and we use network optimization theory to improve it. The presented formulae for partial derivatives, to be used in a non-linear optimization problem, are straightforward and very fast to compute. It makes the proposed non-linear optimization method a viable alternative for linear programming formulations based on piecewise linear approximations.Concluding, E-OBS is shown to be a feasible OBS network architecture of profitable functionality, to support efficiently the QoS provisioning, and to be able to operate with different routing strategies and effectively reduce the network congestion

Algorithms for quality of service provisioning and enhancement in optical burst switched networks

Ph.DDOCTOR OF PHILOSOPH

Datacenter Traffic Control: Understanding Techniques and Trade-offs

Datacenters provide cost-effective and flexible access to scalable compute and storage resources necessary for today's cloud computing needs. A typical datacenter is made up of thousands of servers connected with a large network and usually managed by one operator. To provide quality access to the variety of applications and services hosted on datacenters and maximize performance, it deems necessary to use datacenter networks effectively and efficiently. Datacenter traffic is often a mix of several classes with different priorities and requirements. This includes user-generated interactive traffic, traffic with deadlines, and long-running traffic. To this end, custom transport protocols and traffic management techniques have been developed to improve datacenter network performance. In this tutorial paper, we review the general architecture of datacenter networks, various topologies proposed for them, their traffic properties, general traffic control challenges in datacenters and general traffic control objectives. The purpose of this paper is to bring out the important characteristics of traffic control in datacenters and not to survey all existing solutions (as it is virtually impossible due to massive body of existing research). We hope to provide readers with a wide range of options and factors while considering a variety of traffic control mechanisms. We discuss various characteristics of datacenter traffic control including management schemes, transmission control, traffic shaping, prioritization, load balancing, multipathing, and traffic scheduling. Next, we point to several open challenges as well as new and interesting networking paradigms. At the end of this paper, we briefly review inter-datacenter networks that connect geographically dispersed datacenters which have been receiving increasing attention recently and pose interesting and novel research problems.Comment: Accepted for Publication in IEEE Communications Surveys and Tutorial