QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms

Copyright @ Elsevier Ltd. All rights reserved.In this paper, two bio-inspired Quality of Service (QoS) multicast algorithms are proposed in IP over dense wavelength division multiplexing (DWDM) optical Internet. Given a QoS multicast request and the delay interval required by the application, both algorithms are able to find a flexible QoS-based cost suboptimal routing tree. They first construct the multicast trees based on ant colony optimization and artificial immune algorithm, respectively. Then a dedicated wavelength assignment algorithm is proposed to assign wavelengths to the trees aiming to minimize the delay of the wavelength conversion. In both algorithms, multicast routing and wavelength assignment are integrated into a single process. Therefore, they can find the multicast trees on which the least wavelength conversion delay is achieved. Load balance is also considered in both algorithms. Simulation results show that these two bio-inspired algorithms can construct high performance QoS routing trees for multicast applications in IP/DWDM optical Internet.This work was supported in part ny the Program for New Century Excellent Talents in University, the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1, the National Natural Science Foundation of China under Grant no. 60673159 and 70671020, the National High-Tech Reasearch and Development Plan of China under Grant no. 2007AA041201, and the Specialized Research Fund for the Doctoral Program of Higher Education under Grant no. 20070145017

In-operation planning in flexgrid optical core networks

New generation applications, such as cloud computing or video distribution, can run in a telecom cloud infrastructure where the datacenters (DCs) of telecom operators are integrated in their networks thus, increasing connections' dynamicity and resulting in time-varying traffic capacities, which might also entail changes in the traffic direction along the day. As a result, a flexible optical technology able to dynamically set-up variable-capacity connections, such as flexgrid, is needed. Nonetheless, network dynamicity might entail network performance degradation thus, requiring re-optimizing the network while it is in operation. This thesis is devoted to devise new algorithms to solve in-operation network planning problems aiming at enhancing the performance of optical networks and at studying their feasibility in experimental environments. In-operation network planning requires from an architecture enabling the deployment of algorithms that must be solved in stringent times. That architecture can be based on a Path Computation Element (PCE) or a Software Defined Networks controller. In this thesis, we assume the former split in a front-end PCE, in charge of provisioning paths and handling network events, and a specialized planning tool in the form of a back-end PCE responsible for solving in-operation planning problems. After the architecture to support in-operation planning is assessed, we focus on studying the following applications: 1) Spectrum fragmentation is one of the most important problems in optical networks. To alleviate it to some extent without traffic disruption, we propose a hitless spectrum defragmentation strategy. 2) Each connection affected by a failure can be recovered using multiple paths to increase traffic restorability at the cost of poor resource utilization. We propose re-optimizing the network after repairing the failure to aggregate and reroute those connections to release spectral resources. 3) We study two approaches to provide multicast services: establishing a point-to-multipoint connections at the optical layer and using multi-purpose virtual network topologies (VNT) to serve both unicast and multicast connectivity requests. 4) The telecom cloud infrastructure, enables placing contents closer to the users. Based on it, we propose a hierarchical content distribution architecture where VNTs permanently interconnect core DCs and metro DCs periodically synchronize contents to the core DCs. 5) When the capacity of the optical backbone network becomes exhausted, we propose using a planning tool with access to inventory and operation databases to periodically decide the equipment and connectivity to be installed at the minimum cost reducing capacity overprovisioning. 6) In multi-domain multi-operator scenarios, a broker on top of the optical domains can provision multi-domain connections. We propose performing intra-domain spectrum defragmentation when no contiguous spectrum can be found for a new connection request. 7) Packet nodes belonging to a VNT can collect and send incoming traffic monitoring data to a big data repository. We propose using the collected data to predict next period traffic and to adapt the VNT to future conditions. The methodology followed in this thesis consists in proposing a problem statement and/or a mathematical formulation for the problems identified and then, devising algorithms for solving them. Those algorithms are simulated and then, they are experimentally assessed in real test-beds. This thesis demonstrates the feasibility of performing in-operation planning in optical networks, shows that it enhances the performance of the network and validates the feasibility of its deployment in real networks. It shall be mentioned that part of the work reported in this thesis has been done within the framework of several research projects, namely IDEALIST (FP7-ICT-2011-8) and GEANT (238875) funded by the EC and SYNERGY (TEC2014-59995-R) funded by the MINECO.Les aplicacions de nova generació, com ara el cloud computing o la distribució de vídeo, es poden executar a infraestructures de telecom cloud (TCI) on operadors integren els seus datacenters (DC) a les seves xarxes. Aquestes aplicacions fan que incrementi tant la dinamicitat de les connexions, com la variabilitat de les seves capacitats en el temps, arribant a canviar de direcció al llarg del dia. Llavors, cal disposar de tecnologies òptiques flexibles, tals com flexgrid, que suportin aquesta dinamicitat a les connexions. Aquesta dinamicitat pot degradar el rendiment de la xarxa, obligant a re-optimitzar-la mentre és en operació. Aquesta tesis està dedicada a idear nous algorismes per a resoldre problemes de planificació sobre xarxes en operació (in-operation network planning) per millorar el rendiment de les xarxes òptiques i a estudiar la seva factibilitat en entorns experimentals. Aquests problemes requereixen d’una arquitectura que permeti desplegar algorismes que donin solucions en temps restrictius. L’arquitectura pot estar basada en un Element de Computació de Rutes (PCE) o en un controlador de Xarxes Definides per Software. En aquesta tesis, assumim un PCE principal encarregat d’aprovisionar rutes i gestionar esdeveniments de la xarxa, i una eina de planificació especialitzada en forma de PCE de suport per resoldre problemes d’in-operation planning. Un cop validada l’arquitectura que dona suport a in-operation planning, estudiarem les següents aplicacions: 1) La fragmentació d’espectre és un dels principals problemes a les xarxes òptiques. Proposem reduir-la en certa mesura, fent servir una estratègia que no afecta al tràfic durant la desfragmentació. 2) Cada connexió afectada per una fallada pot ser recuperada fent servir múltiples rutes incrementant la restaurabilitat de la xarxa, tot i empitjorar-ne la utilització de recursos. Proposem re-optimitzar la xarxa després de reparar una fallada per agregar i re-enrutar aquestes connexions tractant d’alliberar recursos espectrals. 3) Estudiem dues solucions per aprovisionar serveis multicast: establir connexions punt-a-multipunt sobre la xarxa òptica i utilitzar Virtual Network Topologies (VNT) multi-propòsit per a servir peticions de connectivitat tant unicast com multicast. 4) La TCI permet mantenir els continguts a prop dels usuaris. Proposem una arquitectura jeràrquica de distribució de continguts basada en la TCI, on els DC principals s’interconnecten per mitjà de VNTs permanents i els DCs metropolitans periòdicament sincronitzen continguts amb els principals. 5) Quan la capacitat de la xarxa òptica s’exhaureix, proposem utilitzar una eina de planificació amb accés a bases de dades d’inventari i operacionals per decidir periòdicament l’equipament i connectivitats a instal·lar al mínim cost i reduir el sobre-aprovisionament de capacitat. 6) En entorns multi-domini multi-operador, un broker per sobre dels dominis òptics pot aprovisionar connexions multi-domini. Proposem aplicar desfragmentació d’espectre intra-domini quan no es pot trobar espectre contigu per a noves peticions de connexió. 7) Els nodes d’una VNT poden recollir i enviar informació de monitorització de tràfic entrant a un repositori de big data. Proposem utilitzar aquesta informació per adaptar la VNT per a futures condicions. La metodologia que hem seguit en aquesta tesis consisteix en formalitzar matemàticament els problemes un cop aquests son identificats i, després, idear algorismes per a resoldre’ls. Aquests algorismes son simulats i finalment validats experimentalment en entorns reals. Aquesta tesis demostra la factibilitat d’implementar mecanismes d’in-operation planning en xarxes òptiques, mostra els beneficis que aquests aporten i valida la seva aplicabilitat en xarxes reals. Part del treball presentat en aquesta tesis ha estat dut a terme en el marc dels projectes de recerca IDEALIST (FP7-ICT-2011-8) i GEANT (238875), finançats per la CE, i SYNERGY (TEC2014-59995-R), finançat per el MINECO.Postprint (published version

Design and protection algorithms for path level aggregation of traffic in WDM metro optical networks

Wavelength Division Multiplexing (WDM) promises to offer a cost effective and scalable solution to meet the emerging demands of the Internet. WDM splits the tremendous bandwidth latent in a fiber into multiple non-overlapping wavelength channels, each of which can be operated at the peak electronic rate. Commercial systems with 128 wavelengths and transmission rates of up to 40 Gbps per wavelength have been made possible using state of the art optical technologies to deal with physical impairments. Systems with higher capacities are likely to evolve in the future. The end user requirements for bandwidth, on the other hand, have been ranging from 155 Mbps to 2.5 Gbps. Dedicating a wavelength for each end user will lead to severe underutilization of WDM channels. This brings to forefront the requirement for sharing of bandwidth in a wavelength among multiple end users.;The concept of wavelength sharing among multiple clients is called grooming. Grooming can be done purely at the optical layer (optical grooming) or it can be done with support from the client layer (electronic grooming). The advantage of all optical grooming is the ease of scalability due to its transparency as opposed to electronic grooming which is constrained by electronic bottlenecks. Efforts towards enhancing optical grooming is pursued through increasing optical switching speeds. However, technologies to make optical switches with high speeds, large port counts and low insertion losses have been elusive and may continue to remain so in the near future.;Recently, there have been some research into designing new architectures and protocols focused on optical grooming without resorting to fast optical switching. Typically, this is achieved in three steps: (1) configure the circuit in the form of a path or a tree; (2) use optical devices like couplers or splitters to allow multiple transmitters and/or receivers to share the same circuit; and (3) provide an arbitration mechanism to avoid contention among end users of the circuit. This transparent sharing of the wavelength channel utilizes the network resources better than the conventional low-speed circuit switched approaches. Consequently, it becomes important to quantify the improvement in achieved performance and evaluate if the reaped benefits justify the cost of the required additional hardware and software.;The contribution of this thesis is two fold: (1) developing a new architecture called light-trails as an IP based solution for next generation WDM optical networks, and (2) designing a unified framework to model Path Level Aggregation of Traffic in metrO Optical Networks (PLATOONs). The algorithms suggested here have three features: (1) accounts for four different path level aggregation strategies---namely, point to point (for example, lightpaths), point to multi-point (for example, source based light-trails), multi-point to point (for example, destination based light-trails) and multi-point to multi-point (for example, light-trails); (2) incorporates heterogenous switching architectures; and (3) accommodates multi-rate traffic. Algorithms for network design and survivability are developed for PLATOONs in the presence of both static and dynamic traffic. Connection level dedicated/shared, segregated/mixed protection schemes are formulated for single link failures in the presence of static and dynamic traffic. A simple medium access control protocol that avoids collisions when the channel is shared by multiple clients is also proposed.;Based on extensive simulations, we conclude that, for the studied scenarios, (1) when client layer has no electronic grooming capabilities, light-trails (employing multi-point to multi-point aggregation strategy) perform several orders of magnitude better than lightpaths and (2) when client layer has full electronic grooming capabilities, source based light-trails (employing point to multi-point aggregation strategy) perform the best in wavelength limited scenarios and lightpaths perform the best in transceiver limited scenarios.;The algorithms that are developed here will be helpful in designing optical networks that deploy path level aggregation strategies. The proposed ideas will impact the design of transparent, high-speed all-optical networks.</p

Energy Efficient IP over WDM Networks Using Network Coding

In this thesis we propose the use of network coding to improve the energy efficiency in core networks, by reducing the resources required to process traffic flows at intermediate nodes. We study the energy efficiency of the proposed scheme through three approaches: (i) developing a mixed integer linear programme (MILP) to optimise the use of network resources. (ii) developing a heuristic based on minimum hop routing. (iii) deriving an analytical bounds and closed form expressions. The results of the MILP model show that implementing network coding over typical networks can introduce savings up to 33% compared to the conventional architectures. The results of the heuristic show that the energy efficient minimum hop routing in network coding enabled networks achieves power savings approaching those of the MILP model. The analytically calculated power savings also confirm the savings achieved by the model. Furthermore, we study the impact of network topology on the savings obtained by implementing network coding. The results show that the savings increase as the hop count of the network topology increases. Using the derived expressions, we calculated the maximum power savings for regular topologies as the number of nodes grows. The power savings asymptotically approach 45% and 23% for the ring (and line) and star topology, respectively. We also investigate the use of network coding in 1+1 survivable IP over WDM networks. We study the energy efficiency of this scheme through MILP, a heuristic with five operating options, and analytical bounds. We evaluate the MILP and the heuristics on typical and regular network topologies. Implementing network coding can produce savings up to 37% on the ring topology and 23% considering typical topologies. We also study the impact of varying the demand volumes on the network coding performance. We also develop analytical bounds for the conventional 1+1 protection and the 1+1 with network coding to verify the results of the MILP and the heuristics and study the impact of topology, focusing on the full mesh and ring topologies, providing a detailed analysis considering the impact of the network size

Towards Scalable Cost-Effective Service and Survivability Provisioning in Ultra High Speed Networks

Optical transport networks based on wavelength division multiplexing (WDM) are considered to be the most appropriate choice for future Internet backbone. On the other hand, future DOE networks are expected to have the ability to dynamically provision on-demand survivable services to suit the needs of various high performance scientific applications and remote collaboration. Since a failure in aWDMnetwork such as a cable cut may result in a tremendous amount of data loss, efficient protection of data transport in WDM networks is therefore essential. As the backbone network is moving towards GMPLS/WDM optical networks, the unique requirement to support DOE’s science mission results in challenging issues that are not directly addressed by existing networking techniques and methodologies. The objectives of this project were to develop cost effective protection and restoration mechanisms based on dedicated path, shared path, preconfigured cycle (p-cycle), and so on, to deal with single failure, dual failure, and shared risk link group (SRLG) failure, under different traffic and resource requirement models; to devise efficient service provisioning algorithms that deal with application specific network resource requirements for both unicast and multicast; to study various aspects of traffic grooming in WDM ring and mesh networks to derive cost effective solutions while meeting application resource and QoS requirements; to design various diverse routing and multi-constrained routing algorithms, considering different traffic models and failure models, for protection and restoration, as well as for service provisioning; to propose and study new optical burst switched architectures and mechanisms for effectively supporting dynamic services; and to integrate research with graduate and undergraduate education. All objectives have been successfully met. This report summarizes the major accomplishments of this project. The impact of the project manifests in many aspects: First, the project addressed many essential problems that arisen in current and future WDM optical networks, and provided a host of innovative solutions though there was no invention or patent filing. This project resulted in more than 2 dozens publications in major journals and conferences (including papers in IEEE Transactions and journals, as well as a book chapter). Our publications have been cited by many peer researchers. In particular, one of our conference papers was nominated for the best paper award of IEEE/Create-Net Broadnets (International Conference on Broadband Communications, Networks, and Systems) 2006. Second, the results and solutions of this project were well received by DOE Labs where presentations were given by the PI. We hope to continue the collaboration with DOE Labs in the future. Third, the project was the first to propose and extensively study multicast traffic grooming, new traffic models such as sliding scheduled traffic model and scheduled traffic model. Our research has sparkled a flurry of recent studies and publications by the research community in these areas. Fourth, the project has benefited a diverse population of students by motivating, engaging, enhancing their learning and skills. The project has been conducted in a manner conducive to the training of students both at graduate and undergraduate levels. As a result, one Ph.D., Dr. Abdur Billah, was graduated. Another Ph.D. student, Tianjian Li, will graduate in January 2007. In addition, four MS students were graduated. One undergraduate student, Jeffrey Alan Shininger, completed his university honors project. Fifth, thanks to the support of this ECPI project, the PI has obtained additional funding from the National Science Foundation, the Air Force Research Lab, and other sources. A few other proposals are pending. Finally, this project has also significantly impacted the curricula and resulted in the enhancement of courses at the graduate and undergraduate levels, therefore strengthening the bond between research and education

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