All optical multicasting in wavelength routing mesh networks with power considerations: design and operation

Wavelength routing Wavelength Division Multiplexing (WDM) are optical networks that support all-optical services. They have become the most appealing candidate for wide area backbone networks. Their huge available bandwidth provides the solution for the exponential growth in trayc demands that is due to the increase in the number of users and the surge of more bandwidth intensive network applications and services. A sizable fraction of these applications and services are of multi-point nature. Therefore, supporting multicast service in this network environment is very critical and unique. The all-optical support of various services has advantages, which includes achieving the signal transparency to its content. Nevertheless, the all-optical operational support comes with an associated cost and new issues that make this problem very challenging. In this thesis, we investigate the power-related issues for supporting multicast service in the optical domain, referred to as All-Optical Multicasting (AOM). Our study treats these issues from two networking contexts, namely, Network Provisioning and Connection Provisioning. We propose a number of optimal and heuristic solutions with a unique objective function for each context. In this regard, the objective function for the network provisioning problem is to reduce the network cost, while the solutions for the connection provisioning problem aim to reduce the connection blocking ratio. The optimal formulations are inherently non-linear. However, we introduce novel methods for linearizing them and formulate the problems as Mixed Integer Linear Programs. Also, the design of the heuristic solutions takes into account various optimization factors which results in efficient heuristics that can produce fast solutions that are relatively close to their optimal counterparts, as shown in the numerical results we present

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

Priority realloc : a threefold mechanism for route and resources allocation in EONs

Cotutela Universitat Politècnica de Catalunya i Escola Politécnica da Universidade de São PauloBackbone networks are responsible for long-haul data transport serving many clients with a large volume of data. Since long-haul data transport service must rely on a robust high capacity network the current technology broadly adopted by the industry is Wavelength Division Multiplexing (WDM). WDM networks enable one single fiber to operate with multiple high capacity channels, drastically increasing the fiber capacity. In WDM networks each channel is associated with an individual wavelength. Therefore a whole wavelength capacity is assigned to a connection, causing waste of bandwidth in case the connection bandwidth requirement is less than the channel total capacity. In the last half decade, Elastic Optical Networks (EON) have been proposed and developed based on the flexible use of the optical spectrum known as the flexigrid. EONs are adaptable to clients requirements and may enhance optical networks performance. For these reasons, research community and data transport providers have been demonstrating increasingly high interest in EONs which are likely to replace WDM as the universally adopted technology in backbone networks in the near future. EONs have two characteristics that may limit its efficient resources use. The spectrum fragmentation, inherent to the dynamic EON operation, decreases the network capacity to assign resources to connection requests increasing network blocking probability. The spectrum fragmentation also intensifies the denial of service to higher rate request inducing service unfairness. Due to the fact EONs were just recently developed and proposed, the aforementioned issues were not yet extensively studied and solutions are still being proposed. Furthermore, EONs do not yet provide specific features as differentiated service mechanisms. Differentiated service strategies are important in backbone networks to guarantee client's diverse requirements in case of a network failure or the natural congestion and resources contention that may occur at some periods of time in a network. Impelled by the foregoing facts, this thesis objective is three-fold. By means of developing and proposing a mechanism for routing and resources assignment in EONs, we intend to provide differentiated service while decreasing fragmentation level and increasing service fairness. The mechanism proposed and explained in this thesis was tested in an EON simulation environment and performance results indicated that it promotes beneficial performance enhancements when compared to benchmark algorithms.Redes backbone sao responsáveis pelo transporte de dados à longa distância que atendem a uma grande quantidade de clientes com um grande volume de dados. Como redes backbone devem basear-se em uma rede robusta e de alta capacidade, a tecnologia atual amplamente adotada pela indústria é Wavelength Division Multiplexing (WDM). Redes WDM permitem que uma única fibra opere com múltiplos canais de alta largura de banda, aumentando drasticamente a capacidade da fibra. Em redes WDM cada canal está associado a um comprimento de onda particular. Por conseguinte, toda capacidade do comprimento de onda é atribuída a uma única conexão, fazendo com que parte da largura de banda seja desperdiçada no caso em que a requisição de largura de banda da conexão seja menor do que a capacidade total do canal. A partir da metade da última década, as Redes Ópticas Elásticas (Elastic Optical Networks - EON) têm sido propostas e desenvolvidas com base no uso flexível do espectro óptico conhecido como flexigrid. EONs são adaptáveis às requisiçes por banda dos clientes e podem, portanto, melhorar o desempenho das redes ópticas. Por estas razões, EONs têm recebido cada vez mais interesse dos meios de pesquisa e provedores de serviço e provavelmente substituirão WDM como a tecnologia universalmente adotada pela indústria em redes backbone. EONs têm duas características que podem limitar a utilização eficiente de recursos. A fragmentação do espectro, inerente à operação dinâmica das EONs, pode diminuir a capacidade da rede em distribuir recursos ao atender às solicitações por conexões aumentando a probabilidade de bloqueio na rede. A fragmentação do espectro também intensifica a negação de serviço às solicitações por taxa de transmissão mais elevada, gerando injustiça no serviço prestado. Como EONs foram desenvolvidas recentemente, respostas às questões acima mencionadas ainda estão sob estudo e soluções continuam sendo propostas na literatura. Além disso, EONs ainda não fornecem funções específicas como um mecanismo que proveja diferenciação de serviço. Estratégias de diferenciação de serviço são importantes em redes backbone para garantir os diversos requisitos dos clientes em caso de uma falha na rede ou do congestionamento e disputa por recursos que podem ocorrer em alguns períodos em uma rede. Impulsionada pelos fatos anteriormente mencionados, esta tese possui três objetivos. Através do desenvolvimento e proposta de um mecanismo de roteamento e atribuição de recursos para EONs, temos a intenção de disponibilizar diferenciação de serviço, diminuir o nível de fragmentação de espectro e aumentar a justiça na distribuição de serviços. O mecanismo proposto nesta tese foi testado em simulações de EONs. Resultados indicaram que o mecanismo proposto promove benefícios através do aprimoramento da performance de uma rede EON quando comparado com algoritmos de referência.Les xarxes troncals son responsables per el transport de dades a llarga distància que serveixen a una gran quantitat de clients amb un gran volum de dades. Com les xarxes troncals han d'estar basades en una xarxa robusta i d'alta capacitat, la tecnologia actual àmpliament adoptada per la indústria és el Wavelength Division Multiplexing (WDM). Xarxes WDM permeten operar amb una sola fibra multicanal d'alt ample de banda, el que augmenta molt la capacitat de la fibra. A les xarxes WDM cada canal est a associat amb una longitud d'ona particular. En conseqüència, tota la capacitat del canal es assignada a una sola connexió, fent que part dels recurs siguin perduts en el cas en que l'ample de banda sol licitada sigui menys que la capacitat total del canal. A gairebé deu anys les xarxes òptiques elàstiques (Elastic Optical Networks -EON) son propostes i desenvolupades basades en el ús visible de l'espectre òptic conegut com Flexigrid. EONs són adaptables a les sol·licituds per ample de banda dels clients i per tant poden millorar el rendiment de les xarxes òptiques. Per aquestes raons, EONs han rebut cada vegada més interès en els mitjans d’investigació i de serveis i, probablement, han de reemplaçar el WDM com la tecnologia universalment adoptada en les xarxes troncals. EONs tenen dues característiques que poden limitar l'ús eficient dels recursos seus. La fragmentació de l'espectre inherent al funcionament dinàmic de les EONs, pot disminuir la capacitat de la xarxa en distribuir els recursos augmentant la probabilitat de bloqueig de connexions. La fragmentació de l'espectre també intensifica la denegació de les sol·licituds de servei per connexions amb una major ample de banda, el que genera injustícia en el servei ofert. Com les EONs s'han desenvolupat recentment, solucions als problemes anteriors encara estan en estudi i les solucions segueixen sent proposades en la literatura. D'altra banda, les EONs encara no proporcionen funcions especifiques com mecanisme de diferenciació de provisió de serveis. Estratègies de diferenciació de servei són importants en les xarxes troncals per garantir les diverses necessitats dels clients en cas d'una fallada de la xarxa o de la congestió i la competència pels recursos que es poden produir en alguns períodes. Impulsada pels fets abans esmentats, aquesta tesi te tres objectius. A través del desenvolupament i proposta d'un mecanisme d'enrutament i assignació de recursos per EONs, tenim la intenció d'oferir la diferenciació de serveis, disminuir el nivell de fragmentació de l'espectre i augmentar l'equitat en la distribució dels serveis. El mecanisme proposat en aquesta tesi ha estat provat en simulacions EONs. Els resultats van indicar que el mecanisme promou millores en el rendiment de la EON, en comparació amb els algoritmes de referència.Postprint (published version

Statistical assessment of open optical networks

In order to cope with the increase of the final user traffic, operators and vendors are pushing towards physical layer aware networking as a way to maximize the network capacity. To this aim, optical networks are becoming more and more open by exposing physical parameters enabling fast and reliable estimation of the lightpath quality of transmission. This comes in handy not only from the point of view of the planning and managing of the optical paths but also on a more general picture of the whole optical network performance. In this work, the Statistical Network Assessment Process (SNAP) is presented. SNAP is an algorithm allowing for estimating different network metrics such as blocking probability or link saturation, by generating traffic requests on a graph abstraction of the physical layer. Being aware of the physical layer parameters and transceiver technologies enables assessing their impact on high level network figures of merit. Together with a detailed description of the algorithm, we present a comprehensive review of several results on the networking impact of multirate transceivers, flex-grid spectral allocation as a means to finely exploit lightpath capacity and of different Space Division Multiplexing (SDM) solutions

Wavelength assignment in optical burst switching networks using neuro-dynamic programming

Cataloged from PDF version of article.All-optical networks are the most promising architecture for building large-size, hugebandwidth transport networks that are required for carrying the exponentially increasing Internet traffic. Among the existing switching paradigms in the literature, the optical burst switching is intended to leverage the attractive properties of optical communications, and at the same time, take into account its limitations. One of the major problems in optical burst switching is high blocking probability that results from one-way reservation protocol used. In this thesis, this problem is solved in wavelength domain by using smart wavelength assignment algorithms. Two heuristic wavelength assignment algorithms prioritizing available wavelengths according to reservation tables at the network nodes are proposed. The major contribution of the thesis is the formulation of the wavelength assignment problem as a continuous-time, average cost dynamic programming problem and its solution based on neuro-dynamic programming. Experiments are done over various traffic loads, burst lengths, and number of wavelength converters with a pool structure. The simulation results show that the wavelength assignment algorithms proposed for optical burst switching networks in the thesis perform better than the wavelength assignment algorithms in the literature that are developed for circuit-switched optical networks.Keçeli, FeyzaM.S

Online regenerator placement.

Connections between nodes in optical networks are realized by lightpaths. Due to the decay of the signal, a regenerator has to be placed on every lightpath after at most d hops, for some given positive integer d. A regenerator can serve only one lightpath. The placement of regenerators has become an active area of research during recent years, and various optimization problems have been studied. The first such problem is the Regeneration Location Problem (Rlp), where the goal is to place the regenerators so as to minimize the total number of nodes containing them. We consider two extreme cases of online Rlp regarding the value of d and the number k of regenerators that can be used in any single node. (1) d is arbitrary and k unbounded. In this case a feasible solution always exists. We show an O(log|X| ·logd)-competitive randomized algorithm for any network topology, where X is the set of paths of length d. The algorithm can be made deterministic in some cases. We show a deterministic lower bound of W([(log(|E|/d) ·logd)/(log(log(|E|/d) ·logd))])log(Ed)logdlog(log(Ed)logd) , where E is the edge set. (2) d = 2 and k = 1. In this case there is not necessarily a solution for a given input. We distinguish between feasible inputs (for which there is a solution) and infeasible ones. In the latter case, the objective is to satisfy the maximum number of lightpaths. For a path topology we show a lower bound of Öl/2l2 for the competitive ratio (where l is the number of internal nodes of the longest lightpath) on infeasible inputs, and a tight bound of 3 for the competitive ratio on feasible inputs