Tato práce se zabývá problematikou zjišťování zpětných cest v Internetu. Nástroj, který by byl schopen určit zpětnou cestu, by mohl být cenný v například v případech, kdy určitá část zákazníků pozoruje zvýšenou latenci při využívání služby. Klasickým nástrojem pro analýzu cesty k cílovému počítači je traceroute. Práce se detailně zabývá diagnostickým nástrojem traceroute a jsou diskutovány nejen jeho rozšíření, ale také nedostatky v sítích, kde se vyskytuje vyvažování provozu, a jejich možná řešení. Nicméně, pokud se problém nachází ve směru od zákazníků k poskytovateli služby, pak odhalení problému může být problematické. Dále je studován existující výzkum v oblasti zjišťování zpětných tras v Internetu a nástroje pro diagnostiku sítě. Součástí práce je navržení a implementace nástroje, který je schopen aproximovat zpětnou cestu s využitím vhodné RIPE Atlas sondy a získaná data dále analyzovat. Implementovaný nástroj byl testován na vytvořené topologii i v reálném provozu s využitím referenčního virtuálního serveru.

With the development of the Internet, new network services with strict network latency requirements have been made possible. These services are implemented as distributed systems deployed across multiple geographical locations. To provide low response time, these services require knowledge about the current network latency. Unfortunately, network latency among geo-distributed sites often change, thus distributed services rely on continuous network latency measurements. One goal of such measurements is to differentiate between momentary latency spikes from relatively long-term latency changes. The differentiation is achieved through statistical processing of the collected samples. This approach of high-frequency network latency measurements has high overhead, slow to identify network latency changes and lacks accuracy. We propose a novel approach for network latency estimation by correlating network paths to network latency. We demonstrate that network latency can be accurately estimated by first measuring and identifying the network path used and then fetching the expected latency for that network path based on previous set of measurements. Based on these principles, we introduce Sudan traceroute, a network latency estimation tool. Sudan traceroute can be used to both reduce the latency estimation time as well as to reduce the overhead of network path measurements. Sudan traceroute uses an improved path detection mechanism that sends only a few carefully selected probes in order to identify the current network path. We have developed and evaluated Sudan traceroute in a test environment and evaluated the feasibility of Sudan traceroute on real-world networks using Amazon EC2. Using Sudan traceroute we have shortened the time it takes for hosts to identify network latency level changes compared to existing approaches. / Med utvecklingen av Internet har nya nätverkstjänster med strikta fördröjningskrav möjliggjorts. Dessa tjänster är implementerade som distribuerade system spridda över flera geografiska platser. För att tillgodose låg svarstid kräver dessa tjänster kunskap om svarstiden i det nuvarande nätverket. Tyvärr ändras ofta nätverksfördröjningen bland geodistribuerade webbplatser, således är distribuerade tjänster beroende av kontinuerliga mätvärden för nätverksfördröjning. Ett mål med sådana mätningar är att skilja mellan momenta ökade svarstider från relativt långsiktiga förändringar av svarstiden. Differentieringen uppnås genom statistisk bearbetning av de samlade mätningarna. Denna högfrekventa insamling av mätningar av nätverksfördröjningen har höga overheadkostnader, identifierar ändringar långsamt och saknar noggrannhet. Vi föreslår ett nytt tillvägagångssätt för beräkningen av nätverksfördröjning genom att korrelera nätverksvägar till nätverksfördröjning. Vi visar att nätverksfördröjningen kan vara exakt uppskattad genom att man först mäter och identifierar den nätverksväg som används och sedan hämtar den förväntade fördröjningen för den nätverksvägen baserad på en tidigare uppsättning av mätningar. Baserat på dessa principer introducerar vi Sudan traceroute, ett Verktyg för att uppskatta nätverksfördröjning. Sudan traceroute kan användas för att både minska tiden att uppskatta fördröjningen samt att minska overhead för mätningarna i nätverket. Sudan traceroute använder en förbättrad vägdetekteringsmekanism som bara skickar några försiktigt valda prober för att identifiera den aktuella vägen i nätverket. Vi har utvecklat och utvärderat Sudan traceroute i en testmiljö och utvärderade genomförbarheten av Sudan traceroute i verkliga nätverk med hjälp av Amazon EC2. Med hjälp av Sudan traceroute har vi förkortat den tid det tar för värdar att identifiera nätverksfördröjnings förändringar jämfört med befintliga tillvägagångssätt.

<p>To detect network changes and network troubles, Transpondertech needs a tool that can make network measurements.</p><p>The purpose of this thesis has been to find measurable network properties that best reflect the status of a network, to find methods to measure these proerties and to implement these methods in one single tool. The resulting tool is called NetworkPerf and can measure the following network properties: availability, round-trip delay, delay variation, number of hops, intermediate hosts, available bandwidth, available ports, and maximum allowed packet size. Together, these properties give a good picture of the status of a network connection.</p><p>The thesis also presents the methods used for meassuring these properties in the tool.</p>

<p>Through the desire of understanding the Internet better, we focused our attention on the modelling of the way data move in the Internet. Our main goal here was to give ideas on what does a route followed by packets look like. </p><p>In most of the simulations, researchers model routes by shortest paths, we try to provide more realistic models to improve simulations accuracy out of concern for keeping it relatively simple. </p><p>To achieve this study, we used the data from the Skitter network measurement platform that runs about thirty monitors which probe tens of thousands destinations per day around the world in order to collect routes packets have followed with the path forwarding method. It is the largest known effort of route collection and also a mean to get a realistic topology of the Internet. </p><p>With the help of the Skitter data we pointed out lots of global and local routes characteristics and we have designed some algorithms to generate fake routes that fit the properties observed.</p>

Through the desire of understanding the Internet better, we focused our attention on the modelling of the way data move in the Internet. Our main goal here was to give ideas on what does a route followed by packets look like. In most of the simulations, researchers model routes by shortest paths, we try to provide more realistic models to improve simulations accuracy out of concern for keeping it relatively simple. To achieve this study, we used the data from the Skitter network measurement platform that runs about thirty monitors which probe tens of thousands destinations per day around the world in order to collect routes packets have followed with the path forwarding method. It is the largest known effort of route collection and also a mean to get a realistic topology of the Internet. With the help of the Skitter data we pointed out lots of global and local routes characteristics and we have designed some algorithms to generate fake routes that fit the properties observed.

To detect network changes and network troubles, Transpondertech needs a tool that can make network measurements. The purpose of this thesis has been to find measurable network properties that best reflect the status of a network, to find methods to measure these proerties and to implement these methods in one single tool. The resulting tool is called NetworkPerf and can measure the following network properties: availability, round-trip delay, delay variation, number of hops, intermediate hosts, available bandwidth, available ports, and maximum allowed packet size. Together, these properties give a good picture of the status of a network connection. The thesis also presents the methods used for meassuring these properties in the tool.

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.

No description available.