IP without IP addresses

D. Phoomikiattisak was funded by the Thai Government. B. Simpson was funded by Cisco Systems under a University Research Programme (URP) grant award.We discuss a key engineering challenge in implementing the Identifier- Locator Network Protocol (ILNP), as described in IRTF Experimental RFCs 6740-6748: enabling legacy applications that use the C sockets API. We have built the first two OS kernel implementations of ILNPv6 (ILNP as a superset of IPv6), in both the Linux OS kernel and the FreeBSD OS kernel. Our evaluation is in comparison with IPv6, in the context of a topical and challenging scenario: host mobility implemented as a purely end-to-end function. Our experiments show that ILNPv6 has excellent potential for deployment using existing IPv6 infrastructure, whilst offering the new properties and functionality of ILNP.Postprin

Seamless Internet connectivity for ubiquitous communication

The direct and flexible use of any network connectivity that is available within an urban scenario is essential for the successful operation of ubiquitous systems. We demonstrate seamless communication across different networks without the use of middleware, proxies, tunnels, or address translation, with minimal (near-zero) packet loss to communication flows as handoff occurs between networks. Our solution does not require any new functions in existing networks, will work on existing infrastructure, and does not require applications to be re-designed or re-engineered. Our solution requires only modifications to the end-systems involved in communication, so can be deployed incrementally only for those end-systems that require the functionality. We describe our approach and its design, based on the use of the Identifier-Locator Network Protocol (ILNP), which can be realised directly on IPv6. We demonstrate the efficacy of our solution with testbed experiments based on modifications to the Linux kernel v4.9 LTS, operating directly over IPv6, and using unmodified binary applications utilising directly the standard socket(2) POSIX.1-2008 API, and standard C library calls. As our approach is 'end-to-end', we also describe how to maintain packet-level secrecy and identity privacy for the communication flow as part of our approach.Postprin

Location Management in IP-based Future LEO Satellite Networks: A Review

Future integrated terrestrial, aerial, and space networks will involve thousands of Low Earth Orbit (LEO) satellites forming a network of mega-constellations, which will play a significant role in providing communication and Internet services everywhere, at any time, and for everything. Due to its very large scale and highly dynamic nature, future LEO satellite networks (SatNets) management is a very complicated and crucial process, especially the mobility management aspect and its two components location management and handover management. In this article, we present a comprehensive and critical review of the state-of-the-art research in LEO SatNets location management. First, we give an overview of the Internet Engineering Task Force (IETF) mobility management standards (e.g., Mobile IPv6 and Proxy Mobile IPv6) and discuss their location management techniques limitations in the environment of future LEO SatNets. We highlight future LEO SatNets mobility characteristics and their challenging features and describe two unprecedented future location management scenarios. A taxonomy of the available location management solutions for LEO SatNets is presented, where the solutions are classified into three approaches. The "Issues to consider" section draws attention to critical points related to each of the reviewed approaches that should be considered in future LEO SatNets location management. To identify the gaps, the current state of LEO SatNets location management is summarized. Noteworthy future research directions are recommended. This article is providing a road map for researchers and industry to shape the future of LEO SatNets location management.Comment: Submitted to the Proceedings of the IEE

Identifier-Locator Network Protocol (ILNP) Engineering Considerations

This document describes common (i.e., version independent) engineering details for the Identifier-Locator Network Protocol (ILNP), which is an experimental, evolutionary enhancement to IP. This document is a product of the IRTF Routing Research Group

Greenow: um algoritmo de roteamento orientado a workspace para uma arquitetura de Internet do futuro

Current and future applications pose new requirements that Internet architecture is not able to satisfy, like Mobility, Multicast, Multihoming, Bandwidth Guarantee and so on. The Internet architecture has some limitations which do not allow all future requirements to be covered. New architectures were proposed considering these requirements when a communication is established. ETArch (Entity Title Architecture) is a new Internet architecture, clean slate, able to use application’s requirements on each communication, and flexible to work with several layers. The Routing has an important role on Internet, because it decides the best way to forward primitives through the network. In Future Internet, all requirements depend on the routing. Routing is responsible for deciding the best path and, in the future, a better route can consider Mobility aspects or Energy Consumption, for instance. In the dawn of ETArch, the Routing has not been defined. This work provides intra and inter-domain routing algorithms to be used in the ETArch. It is considered that the route should be defined completely before the data start to traffic, to ensure that the requirements are met. In the Internet, the Routing has two distinct functions: (i) run specific algorithms to define the best route; and (ii) to forward data primitives to the correct link. In traditional Internet architecture, the two Routing functions are performed in all routers everytime that a packet arrives. This work allows that the complete route is defined before the communication starts, like in the telecommunication systems. This work determined the Routing for ETArch and experiments were performed to demonstrate the control plane routing viability. The initial setup before a communication takes longer, then only forwarding of primitives is performed, saving processing time.Dissertação (Mestrado)A Internet cresceu muito nas últimas décadas e novos requisitos começaram a fazer parte da rede, tais como Mobilidade, Tráfego Multicast, Multihoming, Garantia de Banda etc. A arquitetura atual da Internet não suporta esses requisitos e portanto novas arquiteturas foram propostas. A ETArch (Entity Title Architecture) é uma delas e tem como objetivo garantir que requisitos e capacidades das aplicações sejam considerados para se estabelecer a comunicação da melhor forma. O Roteamento desempenha papel fundamental na Internet, sendo responsável por decidir o caminho pelo qual as primitivas contendo dados serão encaminhadas ao longo da rede. Além disso, todos os requisitos da Internet do Futuro dependem da atuação do roteamento. Na ETArch, o Roteamento é uma questão em aberto. O objetivo deste trabalho é prover algoritmos de roteamento intra e inter-domínio para a ETArch. Como hipótese, assumiu-se que para satisfazer os requisitos das aplicações a rota completa deve ser definida antes que os dados comecem a ser trafegados. As Redes Definidas por Software e tecnologias como OpenFlow viabilizam esta hipótese. Na Internet, o roteamento possui dois papéis distintos: (i) a parte algorítmica, responsável por decidir a melhor rota para a comunicação; e (ii) a parte de encaminhamento, responsável por encaminhar as primitivas de dados para o enlace correto. Nota-se que na arquitetura tradicional da Internet ambos os papéis são realizados toda vez que um pacote chega a um roteador. Este trabalho permite que a rota completa seja definida previamente, ou seja, gasta-se um tempo maior na configuração da rota, porém uma vez configurada a parte algorítmica não é mais realizada, similar ao que acontece na telefonia. Neste trabalho, foi definido o Roteamento para a ETArch e, também, foram realizados experimentos que demonstraram a viabilidade de se escolher rotas previamente. Uma vez que a rota é estabelecida, pode-se garantir que os requisitos das aplicações sejam atendidos e a partir daí apenas encaminhamento de primitivas é necessário, poupando-se tempo de processamento nos elementos de rede (antes necessário para rotear)

Survey on PMIPv6-based Mobility Management Architectures for Software-Defined Networking

Software-Defined Networking (SDN) has changed the network landscape. Meanwhile, IP-based mobility management still evolves, and SDN affects it dramatically. Integrating Proxy Mobile IPv6 (PMIPv6) – a network-based mobility management protocol – with the SDN paradigm has created several promising approaches. This paper will present an extensive survey on the joint research area of PMIPv6 and SDN mobility management by detailing the available SDN-integrated network-based techniques and architectures that intend to accelerate handover and mitigate service disruption of mobility events in softwareized telecommunication networks. The article also provides an overview of where PMIPv6 can be used and how SDN may help reach those ways

An improved locator identifier split architecture (ILISA) to enhance mobility

The increased use of mobile devices has prompted the need for efficient mobility management protocols to ensure continuity of communication sessions as users switch connection between available wireless access networks in an area. Locator/Identifier (LOC/ID) split architectures are designed to, among other functions, enable the mobility of nodes on the Internet. The protocols based on these architectures enable mobility by ensuring that the identifier (IP address) used for creating a communication session is maintained throughout the lifetime of the session and only the location of a mobile node (MN) is updated as the device moves. While the LOC/ID protocols ensure session continuity during handover, they experience packet loss and long service disruption times as the MN moves from one access network to another. The mobility event causes degradation of throughput, poor network utilisation, and affects the stability of some applications, such as video players. This poor performance was confirmed from the experiments we conducted on a laboratory testbed running Locator Identifier Separation Protocol MN (LISP-MN) and Mobile IPv6 (MIPv6). The MIPv6, as the standardised IETF mobility protocol, was used to benchmark the performance of LISP-MN. The poor performance recorded is owed to the design of the LISP-MN’s architecture, with no specific way of handling packets that arrive during handover events. Our main aim in this thesis is to introduce an Improved Locator/Identifier Split Architecture (ILISA) designed to enhance the mobility of nodes running a LOC/ID protocol by mitigating packet loss and reducing service disruption in handovers. A new network node, Loc-server, is central to the new architecture with the task of buffering incoming packets during handover and forwarding the packets to the MN on the completion of the node’s movement process. We implemented ILISA with LISP-MN on a laboratory testbed to evaluate its performance in different mobility scenarios. Our experimental results show a significant improvement in the mobility performance of MNs as reflected by the different network parameters investigated

Multihoming with ILNP in FreeBSD

Multihoming allows nodes to be multiply connected to the network. It forms the basis of features which can improve network responsiveness and robustness; e.g. load balancing and fail-over, which can be considered as a choice between network locations. However, IP today assumes that IP addresses specify both network location and node identity. Therefore, these features must be implemented at routers. This dissertation considers an alternative based on the multihoming approach of the Identifier Locator Network Protocol (ILNP). ILNP is one of many proposals for a split between network location and node identity. However, unlike other proposals, ILNP removes the use of IP addresses as they are used today. To date, ILNP has not been implemented within an operating system stack. I produce the first implementation of ILNP in FreeBSD, based on a superset of IPv6 – ILNPv6 – and demonstrate a key feature of ILNP: multihoming as a first class function of the operating system, rather than being implemented as a routing function as it is today. To evaluate the multihoming capability, I demonstrate one important application of multihoming – load distribution – at three levels of network hierarchy including individual hosts, a singleton Site Border Router (SBR), and a novel, dynamically instantiated, distributed SBR (dSBR). For each level, I present empirical results from a hardware testbed; metrics include latency, throughput, loss and reordering. I compare performance with unmodified IPv6 and NPTv6. Finally, I evaluate the feasibility of dSBR-ILNPv6 as an alternative to existing multihoming approaches, based on measurements of the dSBR’s responsiveness to changes in site connectivity. We find that multihoming can be implemented by individual hosts and/or SBRs, without requiring additional routing state as is the case today, and without any significant additional load or overhead compared to unicast IPv6