A review of IPv6 multihoming solutions

Abstract -Multihoming is simply defined as having connection to the Internet through more than one Internet service provider. Multihoming is a desired functionality with a growing demand because it provides fault tolerance and guarantees a continuous service for users. In the current Internet, which employs IPv4 as the network layer protocol, this functionality is achieved by announcing multihomed node prefixes through its all providers. But this solution, which employs Border Gateway Protocol, is not able to scale properly and adapt to the rapid growth of the Internet. IPv6 offers a larger address space compared to IPv4. Considering rapid growth of the Internet and demand for multihoming, the scalability issues of the current solution will turn into a disaster in the future Internet with IPv6 as the network layer protocol. A wide range of solutions have been proposed for multihoming in IPv6. In this paper, we briefly review active solutions in this area and perform an analysis, from deployability viewpoint, on them

Development of a Graduate Course on the Transition to Internet Protocol Version 6

Internet and mobile connectivity has grown tremendously in the last few decades, creating an ever increasing demand for Internet Protocol (IP) addresses. The pool of Internet Protocol version 4 (IPv4) addresses, once assumed to be more than sufficient for every person on this planet, has reached its final stages of depletion. With The Internet Assigned Numbers Authority’s (IANA) global pools depleted, and four of the five Regional Internet Registries (RIR) pools down to the their last /8 block, the remaining addresses will not last very long. In order to ensure continuous growth of the internet in the foreseeable future, we would need a newer internet protocol, with a much larger address space. Specifically, with that goal in mind the Internet Protocol version 6 (IPv6) was designed about two decades ago. Over the years it has matured, and has proven that it could eventually replace the existing IPv4. This thesis presents the development a graduate level course on the transition to IPv6. The course makes an attempt at understanding how the new IPv6 protocol is different than the currently used IPv4 protocol. And also tries to emphasize on the options existing to facilitate a smooth transition of production networks from IPv4 to IPv6

Sustaining the Internet with Hyperbolic Mapping

The Internet infrastructure is severely stressed. Rapidly growing overheads associated with the primary function of the Internet---routing information packets between any two computers in the world---cause concerns among Internet experts that the existing Internet routing architecture may not sustain even another decade. Here we present a method to map the Internet to a hyperbolic space. Guided with the constructed map, which we release with this paper, Internet routing exhibits scaling properties close to theoretically best possible, thus resolving serious scaling limitations that the Internet faces today. Besides this immediate practical viability, our network mapping method can provide a different perspective on the community structure in complex networks

Measuring Effectiveness of Address Schemes for AS-level Graphs

This dissertation presents measures of efficiency and locality for Internet addressing schemes. Historically speaking, many issues, faced by the Internet, have been solved just in time, to make the Internet just work~\cite{justWork}. Consensus, however, has been reached that today\u27s Internet routing and addressing system is facing serious scaling problems: multi-homing which causes finer granularity of routing policies and finer control to realize various traffic engineering requirements, an increased demand for provider-independent prefix allocations which injects unaggregatable prefixes into the Default Free Zone (DFZ) routing table, and ever-increasing Internet user population and mobile edge devices. As a result, the DFZ routing table is again growing at an exponential rate. Hierarchical, topology-based addressing has long been considered crucial to routing and forwarding scalability. Recently, however, a number of research efforts are considering alternatives to this traditional approach. With the goal of informing such research, we investigated the efficiency of address assignment in the existing (IPv4) Internet. In particular, we ask the question: ``how can we measure the locality of an address scheme given an input AS-level graph?\u27\u27 To do so, we first define a notion of efficiency or locality based on the average number of bit-hops required to advertize all prefixes in the Internet. In order to quantify how far from ``optimal the current Internet is, we assign prefixes to ASes ``from scratch in a manner that preserves observed semantics, using three increasingly strict definitions of equivalence. Next we propose another metric that in some sense quantifies the ``efficiency of the labeling and is independent of forwarding/routing mechanisms. We validate the effectiveness of the metric by applying it to a series of address schemes with increasing randomness given an input AS-level graph. After that we apply the metric to the current Internet address scheme across years and compare the results with those of compact routing schemes

Congestion control mechanisms within MPLS networks

PhDAbstract not availabl

Navigability and synchronization in complex networks: a computational approach

Les xarxes complexes han demostrat ser una eina molt valuosa per estudiar sistemes reals, en part, gràcies a la creixent capacitat de computació. En aquesta tesi abordem computacionalment diversos problemes dividits en dos blocs. El primer bloc està motivat pels problemes que planteja la ràpida evolució de la Internet. D’una banda, el creixement exponencial de la xarxa està comprometent la seva escalabilitat per les dependències a les taules d’enrutament globals. Al Capítol 4 proposem un esquema d’enrutament descentralitzat que fa servir la projecció TSVD de l’estructura mesoscòpica de la xarxa com a mapa. Els resultats mostren que fent servir informació local podem guiar amb èxit en l’enrutament. Al Capítol 3 també avaluem la fiabilitat d’aquesta projecció davant el creixement de la xarxa. Els resultats indiquen que aquest mapa és robust i no necessita actualitzacions contínues. D’altra banda, la creixent demanda d’ample de banda és un factor potencial per produir congestió. Al Capítol 5 estenem un esquema d’enrutament dinàmic en el context de les xarxes multiplex, i l’analitzem amb xarxes sintètiques amb diferents assortativitats d’acoblament. Els resultats mostren que tenir en compte el volum de trànsit en l’enrutament retarda l’inici de la congestió. Tot i això, la distribució uniforme del trànsit produeix una transició de fase abrupta. Amb tot, l’acoblament assortatiu es presenta com la millor opció per a dissenys de xarxes òptimes. El segon bloc ve motivat per l’actual crisi financera mundial. Al Capítol 6 proposem estudiar la propagació de les crisis econòmiques utilitzant un model simple de xarxa formada per oscil·ladors integrate-and-fire, i caracteritzar la seva sincronització durant l’evolució de la xarxa de comerç. Els resultats mostren l’aparició d’un procés de globalització que dilueix les fronteres topològiques i accelera la propagació de les crisis financeres.Las redes complejas han demostrado ser una herramienta muy valiosa para estudiar sistemas reales, en parte, gracias a la creciente capacidad de computación. En esta tesis abordamos computacionalmente varios problemas divididos en dos bloques. El primer bloque está motivado por los problemas que plantea la rápida evolución de Internet. Por un lado, el crecimiento exponencial de la red está comprometiendo su escalabilidad por las dependencias a las tablas de enrutado globales. En el Capítulo 4 proponemos un esquema de enrutamiento descentralizado que utiliza la proyección TSVD de la estructura mesoscópica de la red como mapa. Los resultados muestran que utilizando información local podemos guiar con éxito el enrutado. En el Calítulo 3 también evaluamos la fiabilidad de esta proyección bajo cambios en la topología de la red. Los resultados indican que este mapa es robusto y no necesita actualizaciones continuas. Por otra parte, la creciente demanda de ancho de banda es un factor potencial de congestión. En el Capítulo 5 extendemos un esquema de enrutamiento dinámico en el marco de las redes multiplex, y lo analizamos en redes sintéticas con distintas asortatividades de acoplamiento. Los resultados muestran que tener en cuenta el volumen de tráfico en el enrutado retrasa la congestión. Sin embargo, la distribución uniforme del tráfico produce una transición de fase abrupta. Además, el acoplamiento asortativo se presenta como la mejor opción para diseños de redes óptimas. El segundo bloque viene motivado por la actual crisis financiera mundial. En el Capítulo 6 proponemos estudiar la propagación de las crisis económicas utilizando un modelo simple de red formada por osciladores integrate-and-fire, y caracterizar su sincronización durante la evolución de la red de comercio. Los resultados muestran la aparición de un proceso de globalización que diluye las fronteras topológicas y acelera la propagación de las crisis financieras.Complex networks are a powerful tool to study many real systems, partly thanks to the increasing capacity of computational resources. In this dissertation we address computationally a broad scope of problems that are framed in two parts. The first part is motivated by the issues posed by the rapid evolution of the Internet. On one side, the exponential growth of the network is compromising its scalability due to dependencies on global routing tables. In Chapter 4 we propose a decentralized routing scheme that exploits the TSVD projection of the mesoscopic structure of the network as a map. The results show that, using only local information, we can achieve good success rates in the routing process. Additionally, Chapter 3 evaluates the reliability of this projection when network topology changes. The results indicate that this map is very robust and does not need continual updates. On the other side, the increasing bandwidth demand is a potential trigger for congestion episodes. In Chapter 5 we extend a dynamic traffic-aware routing scheme to the context of multiplex networks, and we conduct the analysis on synthetic networks with different coupling assortativity. The results show that considering the traffic load in the transmission process delays the congestion onset. However, the uniform distribution of traffic produces an abrupt phase transition from free-flow to congested state. Withal, assortative coupling is depicted as the best consideration for optimal network designs. The second part is motivated by the current global financial crises. Chapter 6 presents a study on the spreading of economic crises using a simple model of networked integrate-and-fire oscillators and we characterize synchronization process on the evolving trade network. The results show the emergence of a globalization process that dilutes the topological borders and accelerates the spreading of financial crashes

Use of locator/identifier separation to improve the future internet routing system

The Internet evolved from its early days of being a small research network to become a critical infrastructure many organizations and individuals rely on. One dimension of this evolution is the continuous growth of the number of participants in the network, far beyond what the initial designers had in mind. While it does work today, it is widely believed that the current design of the global routing system cannot scale to accommodate future challenges. In 2006 an Internet Architecture Board (IAB) workshop was held to develop a shared understanding of the Internet routing system scalability issues faced by the large backbone operators. The participants documented in RFC 4984 their belief that "routing scalability is the most important problem facing the Internet today and must be solved." A potential solution to the routing scalability problem is ending the semantic overloading of Internet addresses, by separating node location from identity. Several proposals exist to apply this idea to current Internet addressing, among which the Locator/Identifier Separation Protocol (LISP) is the only one already being shipped in production routers. Separating locators from identifiers results in another level of indirection, and introduces a new problem: how to determine location, when the identity is known. The first part of our work analyzes existing proposals for systems that map identifiers to locators and proposes an alternative system, within the LISP ecosystem. We created a large-scale Internet topology simulator and used it to compare the performance of three mapping systems: LISP-DHT, LISP+ALT and the proposed LISP-TREE. We analyzed and contrasted their architectural properties as well. The monitoring projects that supplied Internet routing table growth data over a large timespan inspired us to create LISPmon, a monitoring platform aimed at collecting, storing and presenting data gathered from the LISP pilot network, early in the deployment of the LISP protocol. The project web site and collected data is publicly available and will assist researchers in studying the evolution of the LISP mapping system. We also document how the newly introduced LISP network elements fit into the current Internet, advantages and disadvantages of different deployment options, and how the proposed transition mechanism scenarios could affect the evolution of the global routing system. This work is currently available as an active Internet Engineering Task Force (IETF) Internet Draft. The second part looks at the problem of efficient one-to-many communications, assuming a routing system that implements the above mentioned locator/identifier split paradigm. We propose a network layer protocol for efficient live streaming. It is incrementally deployable, with changes required only in the same border routers that should be upgraded to support locator/identifier separation. Our proof-of-concept Linux kernel implementation shows the feasibility of the protocol, and our comparison to popular peer-to-peer live streaming systems indicates important savings in inter-domain traffic. We believe LISP has considerable potential of getting adopted, and an important aspect of this work is how it might contribute towards a better mapping system design, by showing the weaknesses of current favorites and proposing alternatives. The presented results are an important step forward in addressing the routing scalability problem described in RFC 4984, and improving the delivery of live streaming video over the Internet