Internet traffic has surpassed voice traffic and is dominating in transmission networks. The Internet Protocol (IP) is now being used to encapsulate various kinds of services. The new services have different requirements than the initial type of traffic that was carried by the Internet network and IP. Interactive services such as voice and video require paths than can guarantee some bandwidth level, minimum delay and jitter. In addition service providers need to be able to improve the performance of their networks by having an ability to steer the traffic along the less congested links or paths, thus balancing the load in a uniform way as a mechanism to provide differentiated service quality. This needs to be provided not only within their domains but also along paths that might traverse more than one domain. For this to be possible changes have been proposed and some are being applied to provide quality of service (QoS) and traffic engineering (TE) within and between domains. Because data networks now carry critical data and there are new technologies that enable providers to carry huge amount of traffic, it is important to have mechanisms to safeguard against failures that can render the network unavailable. In this thesis we propose and develop mechanisms to enable interdomain traffic engineering as well as to speed up the restoration time in optical transport networks. We propose a mechanism, called abstracted path information, that enable peering entities to exchange just enough information to engage in QoS and TE operations without divulging all the information about the internal design of the network. We also extend BGP to carry the abstracted information. Our simulations show that BGP could still deliver the same performance with the abstracted information. In this thesis we also develop a method of classifying failures of links or paths. To improve the restoration time we propose that common failures be classified and assigned error type numbers and we develop a mechanism for interlayer communication and faster processing of signalling messages that are used to carry notification signals. Additionally we develop a mechanism of exchanging the failure information between layers through the use of service primitives; that way we can speed up the restoration process. Finally we simulate the developed mechanism for a 24 node Pan American optical transport network. / <p>QC 20100913</p>

Interdomain traffic engineering (TE) controls the flow of traffic between autonomous systems (ASes) to achieve performance goals under various resource constraints. Interdomain TE can be categorized into ingress TE and egress TE, which aim to control the ingress and egress traffic flow in a network, respectively. Most interdomain TE techniques are based on BGP, which was not designed to support performance based routing. Hence even though some basic interdomain TE techniques are widely deployed, their overall effectiveness and impact on interdomain traffic are not well understood. Furthermore, systematic practices for deploying these techniques have yet to be developed. In this thesis, we explore these open issues for both ingress and egress TE. We first focus on the AS-Path prepending technique in interdomain ingress TE. We design a polynomial algorithm that takes network settings as input and produces the optimal prepending at each ingress link. We also develop methods to measure the inputs of the optimal algorithm by leveraging widely available looking glass severs and evaluate the errors of such measurement. We further propose an algorithm, based on this optimal algorithm, that is robust to input errors. We then focus on Intelligent Routing Control (IRC) systems often used at multihomed networks for egress interdomain TE. To address the possible traffic oscillation problem caused by multiple IRC systems, we design a class of randomized IRC algorithms. Through simulations, we show that the proposed algorithms can effectively mitigate oscillations. We also show that IRC systems using randomized path switching algorithms perform better than those switching path deterministically, when both types of IRC systems co-exist. To further understand the performance impact of IRC systems, we next focus on the performance of applications, such as TCP connections. We study the synergistic and antagonistic interactions between IRC and TCP connections, through a simple dual-feedback model. We first examine the impact of sudden RTT and available bandwidth changes in TCP connection. We then examine the effect of IRC measurement delays on closed loop traffic. We also show the conditions under which IRC is beneficial under various path impairment models.

Internet est le résultat de l’interaction des milliers de réseaux qui le composent. On les appelle les systèmes autonomes, chacun est identifié par un numéro unique (ASN). Les politiques de routage des AS et les accords économiques restent confidentiels normalement. Afin de mieux comprendre le routage dans l’Internet, les chercheurs modèlent le routage. Le model souvent utilisé c’est la représentation d’un AS par un atome. Nous présentons trois contributions dans ce travail. On montre d’abord des contradictions entre les décisions de routage réellement faites et les inférences à partir d’un ensemble d’hypothèses souvent utilisées. 70% des instances de ce qu’on appelle «plusieurs sorties» montrent des incohérences. Le routage est appelé à plusieurs sorties quand un AS utilise simultanément plusieurs routes vers la même destination, et chacune passe par un AS différent. Notre deuxième contribution est sur les routes BGP erronées causées par des mauvaises configurations liées à la transaction de la représentation des ASNs de 16-bits à 32-bits et l’utilisation d’AS23456 pour assurer la compatibilité. Nous montrons que tels erreurs sont encore présentes, ensuite nous montrons les effets des routes qui contiennent AS23456 sur les travaux qui emploient ces routes. Notre dernière contribution concerne les dynamiques de de routage dans l’Internet. Nous proposons une méthode pour quantifier ces dynamiques dans chaque AS afin d’en extraire ceux les plus dynamiques. Ensuite, on se concentre sur l’AS Level 3, l’AS le plus dynamique. Nous expliquons que la raison pour ce grand nombre de dynamique c’est l’équilibration de charge entre des routeurs qui avait plusieurs liens physiques. / Internet is the result of interaction of the thousands of networks that compose it. Each of them is called an autonomous system (AS) and has a unique number (ASN). Routing policies of ASes and business agreements remain in most cases confidential. To understand Internet routing, researchers use routing models. A large family of models represents an AS as an atomic structure. We make in this work three contributions. We look first on a set of commonly made assumptions to show using what we call multi-exit routing contradictions in routing decisions between real routing observed in publicly available measurements and that inferred from the assumptions. Sometimes, more than 70% of multi-exit instances show incoherencies. Multi-exit routing happens when an AS uses simultaneously different routes to a destination, each passing through a different AS. Our second contribution concerns erroneous BGP routes due to misconfigurations in BGP routers related to AS_TRANS, the solution introduced to assure the compatibility with old BGP routers when the change was made to represent ASNs on 32-bits instead of 16-bits. We show that such errors are indeed present, then we show how they can affect work making use of routes carrying this ASN. Our last contribution concerns routing dynamics in the Internet. We propose a method to quantity routing dynamics in each AS, then we look on ASes that have a large proportion of dynamics. After that, we focus on the AS Level 3, one of the ASes that we observe to be most dynamic. We explain that one of the reasons of a large part of the observed dynamics is load balancing between routers that have multiple physical links between each of them.

Made available in DSpace on 2015-04-11T14:02:50Z (GMT). No. of bitstreams: 1 ricardo.pdf: 1126811 bytes, checksum: 85736cdaf1e7cf53e93c63df8abb6b16 (MD5) Previous issue date: 2013-07-29 / CNPq - Conselho Nacional de Desenvolvimento Científico e Tecnológico / The Internet is organized on network groups managed by administrative domains known as Autonomous Systems (ASes). Each AS employs its own routing policies and has autonomy in comparison to other ASes. The comunication and coordination between these ASes is made possible by the interdomain routing protocol. The Border Gateway Protocol (BGP)is the interdomain routing protocol currently used on Internet. However, the Internet s interdomain routing architecture has undergone only minor changes since its inception. It presents issues difficult to solve, because of the barrier to deploy new features, the hardness to understand its behavior and dynamics, and complexity to identify and correct faults. The deployment on Internet architecture is a tough task, because the need to deploy it directly on routers. Besides that, there is a requirement of global acceptance of new protocols and modifications. We observed that Software Defined Networking (SDN) could be used to provide innovation on interdomain routing, but it lacked mechanisms support this approach. SDN is an emerging paradigm composed by a data plane, a control plane, and an open protocol. On this work we present a mechanism able to perform interdomain routing with domains that deploys SDN paradigm, called Inter-SDN Routing Component. We point out the main issues on current interdomain routing, describes the Inter-SDN component, its behavior, and its experimental evaluation. Besides that, we show how prototyping and building of an interdomain mechanism on SDN are tasks relatively simple, and explain how our solution takes advantage of the SDN features to address the issues of the interdomain routing. / A Internet está organizada em grupos de redes que são gerenciados por domínios ad- ministrativos conhecidos como Sistemas Autônomos (ASes Autonomous Systems). Cada AS emprega suas próprias políticas de roteamento e tem autonomia em relação a outros ASes. A comunicação e coordenação entre estes ASes acontece por meio do protocolo de roteamento interdomínio. O Protocolo de Roteamento de Borda (BGP Border Gateway Protocol) é o protocolo de roteamento interdomínio atualmente utilizado na Internet. Entretanto, a arquitetura do roteamento interdomínio da Internet tem sofrido poucas mudanças desde sua criação. Ela apresenta problemas complexos de serem resolvidos, devido à dificuldade para a implantação de novas soluções, à dificuldade de entender seu comportamento e dinâmica, e à complexidade de identificar e corrigir falhas. A implantação de novas funcionalidades na arquitetura da Internet é uma tarefa difícil, devido à necessidade de manipular diretamente todos os roteadores. Além disso, é necessário aceitação global de novos protocolos e modificações nos existentes. Nós observamos que a abordagem Redes Definidas por Software (SDN Software-Defined Networking) poderia ser usada para prover inovação no roteamento interdomínio, mas que faltavam mecanismos para suportar esse tipo de roteamento. Neste trabalho, nós apresentamos um mecanismo capaz de realizar o roteamento interdomínio entre domínios que utilizam o paradigma SDN, chamado Inter-SDN. Nós ressaltamos os principais problemas no modelo atual de roteamento interdomínio, descrevemos o componente Inter-SDN, seu comportamento, e apresentamos uma análise experimental. Além disso, nós mostramos como o projeto e a construção de um mecanismo de roteamento interdomínio em SDN são tarefas relativamente simples, e explicamos como nossa solução utiliza as vantagens do SDN para resolver problemas do roteamento interdomínio.