Search

To cope with the scalability issue of current Internet inter-domain routing system, several proposals addressing identifier and locator separation are proposed recently. LISP is one of them. In a LISP-capable network, when end-system identifier (EID) is not routable, a mapping system must map an EID to a routing locator (RLOC). By optimizing EID-RLOC Mapping Assignment (ERMA) for an AS, inbound traffic can be optimally distributed in the AS. In this paper, ERMA optimization problem is studied. We introduced an online ERMAO scheme based on delay information of probe packets. Simulation results show that online optimizing ERMA can achieve better network performance, e.g., lower packet delay and maximum link utilization.

Part 8: Next Generation Internet; International audience; Due to scalability issues that the current Internet is facing, the research community has re-discovered the Locator/ID Split paradigm. As the name suggests, this paradigm is based on the idea of separating the identity from the location of end-systems, in order to increase the scalability of the Internet architecture. One of the most successful proposals, currently under discussion at the IETF, is LISP (Locator/ID Separation Protocol). A critical component of LISP, from a performance and resources consumption perspective, as well as from a security point of view, is the LISP Cache. The LISP Cache is meant to temporarily store mappings, i.e., the bindings between identifiers and locations, in order to provide routers with the knowledge of where to forward packets. This paper presents a thorough analysis of such a component, based on real packet-level traces. Furthermore, the implications of policies to increase the level of security of LISP are also analyzed. Our results prove that even a timeout as short as 60 seconds provides high hit ratio and that the impact of using security policies is small.

Part 6: Quality through Routing, Naming and Control; International audience; Next Generation Internet points out the challenge of addressing “things” on both a network with (wired) and without (wireless) infrastructure. In this scenario, new efficient and scalable addressing and routing schemes must be sought, since currently proposed solutions can hardly manage current scalability issues on the current global Internet routing table due to for example multihoming practices. One of the most relevant proposals for an addressing scheme is the Locator Identifier Separation Protocol (LISP) that focuses its key advantage on the fact that it does not follow a disruptive approach. Nevertheless, LISP has some drawbacks especially in terms of reachability in the border routers. In face of this, in this paper we propose a protocol so-called LISP Redundancy Protocol (LRP), which provides an interesting approach for managing the reachability and reliability issues common on a LISP architecture, such as those motivated by an inter-domain link failure.

The Internet of Things is rapidly diffusing, though severe modifications are needed to the current Internet architecture to cope with its new requirements. A major step forward is decoupling the name of an object (identifier) from its physical location (locator), which are both expressed by the IP address currently. We argue that additional advantages can be brought if context metadata are provided along with the locator, thus forming an enriched locator. In this work, we propose an efficient architecture that allows the enriched locators to be distributed efficiently and in a scalable manner. The distribution protocol exploits the multiple Distributed Hash Table concept, which is well established in peer-to-peer overlays. Preliminary evaluation results obtained with a practical testbed implemented are reported.

There is a growing consensus that identifier/locator separation is a promising solution to the scalability issue of the current routing infrastructure. After locators are separated from identifiers, end hosts roam from place to place without changing their identifiers. On the other hand, their locators change when they roam from one place to another, which leads to changes of identifier-to-locator mappings. In this paper, we quantify the rate of change in identifier-to-locator mappings by analyzing the intervals of consecutive handovers, based on real data traces collected from 2,348 buses, 536 taxis, and several tens of pedestrians. We believe that our results lay a solid foundation for the design and performance evaluation of mapping mechanisms that map identifiers onto locators in networks with identifier/locator separation.

The overload of IP address is regarded as an important reason to create routing scaling issues. There have been several proposals to address this problem, such as Shim6, HIP and LISP. LISP, as one of the most representative proposal, separates IP address into Endpoint Identifier (EID) and Routing Locator (RLOC). To map identifiers onto locators, there must be a mapping system. In this paper, we propose a hybrid hierarchical mapping system called H2M2, which divides Internet into two levels. We regard EIDs are flat intra-domain while they are aggregated inter-domain. In H2M2, the bottom level maintains the EID-to-RLOC mappings within one domain, while the upper level keeps the EID-to-AS mappings of the global network. We describe how H2M2 works in detail. We show that H2M2 can be deployed incrementally, support mobility well and achieve good scalability. In addition, we give some numerical results. The results show that an AS can choose its intra-domain mechanism and it has effect on the load of the mapping system and the resolution delay.

In the traditional Transmission Control Protocol/Internet Protocol (TCP/IP) stacks, IP address represents not only the identifier but also the location of a node so that it can not provide global roaming seamless. To address this problem, MIP (Mobile IP) uses dynamical care-of-address to indicate mobile node's location and stable home address to indicate its identifier. However, such a separation of MIP can not support routing scalability, location privacy and manageability. In this paper, we propose identifier/locator split architecture which contains an overlay mapping system to store the identifier-to-locator binding and manage mobile nodes' behavior. In addition, we design a novel mobility management scheme based on the identifier/locator split architecture (MMILS) which can solve the above issues of Mobile IP. MMILS can distinguish micro mobility and macro mobility scheme to localize location update and alleviate the burden of the mapping system. To evaluate the efficiency of MMILS, we establish an analytical model and formulate the location update signaling cost. Numerical results demonstrate that the proposed scheme can effectively reduce signaling traffic compared to MIP and HMIP (Hierarchical Mobile IP).

Recently, scaling problems faced by today's Internet are attracting more and more attentions. It is commonly recognized that separating IP address into identifier and locator is an effective way to solve the problem. How to map identity onto locator is a critical challenge for the locator/ID separation network. We present a resolution of mapping service based on one-hop DHT to resolve a locator for a given identifier. In the proposed scheme, we evaluate the number of items, the bandwidth of a Map-Server, the effect of mobility and the resolution delay. The results show that the system can support mobility and has very low load and resolution delay.

The Locator/Identifier Separation Protocol (LISP) is a new routing architecture for the Internet that separates local and global routing. It offers more flexibility to edge networks and has the potential to reduce the growths of the BGP routing tables. Recently, a concept for mobility in LISP (LISP Mobile Node, LISP-MN) was presented. We analyze LISP-MN and show that it needs double mapping lookups in all LISP gateways, leads to triangle routing under some conditions, and requires double encapsulation. We propose gradual improvements to LISP-MN that avoid these drawbacks under many conditions.

Concepts for a next generation Internet architecture quite often propose to decouple identifiers from locators. The so-called locator/identifier-split solves several problematic issues of today's Internet architecture. At the same time, however, a user's location is exposed within the whole network and any participant can be traced. Privacy considerations, therefore, need to be a key design element for any locator/identifier-split architecture. In this paper, we introduce a novel privacy service for locator/identifier-split architectures. The service is following Mobile IP's proxy idea and introduces mechanisms to overcome the unwanted side effects of such an approach. The concept decouples the privacy service from the network and leaves it open to the customer whether he wants to subscribe or not.

Separation of identifier and locator provides good conditions of routing scalability and mobility for Internet routing and IP addressing. Based on the idea of identifier and locator separation, in this paper we introduce the access identifier (AID) and the routing locator (RLOC), design a network locality-aware distributed hash table (NLA-DHT), then present an identifier mapping information storage algorithm with network locality-aware capability (N3-Chord). Simulation performance shows that, the identifiers of distributed network storage nodes assigned by NLA-DHT with good query performance in network topology locality consistency, and the query efficiency and network fault handling capability of N3-Chord is much superior to ChordFingerPNS and ChordFinger.

With the boom of network technologies, the Internet architecture is being challenged by new problems such as routing scalability and mobility in these days. Although some related proposals were proposed, an interesting and open issue is that how to support mobility in the locator/ID separation based routing scalability networks. In this paper, we propose MobileID, which is an efficient approach to solve this issue. MobileID is a network-based proposal, in which the network is responsible for the mobility management of mobile nodes. Thus, it can satisfy the requirements of faster handover, route optimism, transport connection survivability, and so on. MobileID also inherit the characters of locator/ID separation protocol which can solve routing scalability problems. At the end of this paper, we describe MobileID analytic model, and compares MobileID handover performance with mobile IP and proxy mobile IP. The result shows the efficiency of MobileID.

It has been recognized that today's Internet routing and addressing system is facing serious scalability problems. The ever increasing network customers, multihoming, and traffic engineering, are driving the growth of Default Free Zone routing table size at an alarming rate. To solve this issue, several solutions have been proposed to separate the current single numbering space, i.e., the "IP address", into the routing locators' space and the end-systems identifiers' space. In this paper, we first review the recent locator/identifier separation proposals, and give a general classification of them according to their deployment scenarios. We then focus on evaluating the performance of the scalable routing architecture based on the locator/identifier separation. In particular, we explore the improvements that can be achieved in terms of the isolation of providers from customers, the reduction of the global routing table size, and the decrease on the number of routing updates. Furthermore, we evaluate the impact of provider changes on deploying the locator/identifier separation, and suggest that automatic allocation and configuration methods for locator-to-identifier mappings may need to be developed.

The Locator/Identifier Separation Protocol (LISP) is being considered in the Internet community as an evolutionary path towards Future Internet. Routing scalability and enhanced Traffic Engineering capabilities beyond BGP are major highlights of the proposal. An implementation from Cisco Systems is being tested in a global infrastructure named LISP+ALT, while an open source implementation, namely OpenLISP, is also being deployed. The main goal of our LISP implementation is to have a quick prototype development cycle, targeting real and simulated environments: the Linux Operating System and the ns-3 Network Simulator. We seek to analyze LISP capabilities, with emphasis in the manageability of the protocol, noticing that there is no clear Data and Control Plane separation in the specification.

Today's Internet is facing routing scalability issues, which could degrade network performance seriously. To solve that, several solutions are currently being discussed. Among them, one promising approach is to set up a new architecture which separates the locator and the identifier roles of current IP addresses. A key question for the solution is how to provide an efficient and reliable service for mapping the identifiers to the locators in the new architecture. We propose a mapping system design based on Distributed Hash Tables (DHTs).

The Routing Research Group (RRG) of the Internet Research Task Force (IRTF) is currently discussing several architectural solutions to build an interdomain routing architecture that scales better than the existing one. The solutions family currently being discussed concerns the addresses separation into locators and identifiers, LISP being one of them. Such a separation provides opportunities in terms of traffic engineering. In this paper, we propose an open and flexible solution that allows an ISP using identifier/locator separation to engineer its interdomain traffic. Our solution relies on the utilization of a service that transparently ranks paths using cost functions. We implement a prototype server and demonstrate its benefits in a LISP testbed.

An Identifier/Locator addressing scheme can enable a new approach to mobile hosts and mobile networks. Identifier and Locator information is stored in Domain Name System (DNS) Resource Records. In our on-going work using the Identifier-Locator Network Protocol (ILNP), the DNS would be updated with new Locator values as hosts and/or networks move; new sessions would obtain the correct Locator(s) for a mobile host and/or mobile network from the DNS, in much the same way as currently happens for IP address resolution. However, this use of the DNS is not currently required for IP mobility. We examine the potential impact on DNS from using a naming approach to mobility.

We have developed an identifier/locator split network architecture that uses separate sets of entities for identifiers and locators in order to eliminate certain problems that will arise if conventional Internet architecture, which uses Internet Protocol addresses as both node identifiers and locators, is used in the new generation network, which will have a very large number of heterogeneous devices. If conventional architecture is used, there will be particular problems in several areas, including mobility and multihoming management, security and privacy, scalable routing, and traffic engineering. In our architecture, identifiers are used in the application and transport layers for identifying nodes, and locators are used in the network layer for locating nodes in the network topology. Nodes can change locators at any time without disrupting ongoing communication sessions, thus supporting efficient mobility and multihoming. The identifiers, which are independent of internetworking technology, are compatible with existing and future locators and routing systems.

Research around the tenets of a next generation Internet architecture has resulted in numerous future Internet proposals, both evolutionary and clean slate. One promising approach is the identifier/locator split, which opens a new paradigm of network communications by using static node identifiers uncoupled from the actual network location. In this work, we validate our instantiation of an id/loc splitted next generation Internet architecture in respect of legacy application support. Our prototype implementation demonstrates that existing SIP services can benefit from the inherent capabilities of the proposed architecture in terms of transparent mobility and security support.

Recent activities in the IRTF (Internet Research Task Force), and in particular in the Routing Research Group (RRG), focus on defining a new Internet architecture, in order to solve scalability issues related to interdomain routing. The research community has agreed that the separation of the end-systems' addressing space (the identifiers) and the routing locators' space will alleviate the routing burden of the Default Free Zone. Nevertheless, such approach, adding a new level of indirection, implies the need of storing and distributing mappings between identifiers and routing locators. In this paper we present LISP-DHT, a mapping distribution system based on Distributed Hash Tables (DHTs). LISP-DHT is designed to take full advantage of the DHT architecture in order to build an efficient and secured mapping lookup system while preserving the locality of the mapping. The paper describes the overall architecture of LISP-DHT, explaining its main points and how it works.

The Locator/Identifier Separation Protocol (LISP) is one of the candidate solutions to address the scalability issues in inter-domain routing. The current proposals for its control plane (e.g., ALT, CONS, NERD) have various shortcomings, including the potential dropping of packets at LISP routers during the resolution of the EID-to-RLOC mapping. In this paper, we introduce a new Control Plane (CP) for LISP supported by an architecture that borrows concepts from both the Path Computation Element (PCE) and Intelligent Route Control (IRC). Our CP is able to tackle three different problems simultaneously: (i) packets sourced from end-hosts are neither dropped nor queued during the mapping resolution; (ii) the EID-to-RLOC mapping can be obtained and configured approximately within the DNS resolution time needed to fetch the destination EID address; and (iii) our approach can blend IRC with the PCE capabilities, to perform upstream/downstream Traffic Engineering (TE) through the dynamic management of the mappings. In particular, our CP supports the utilization of different LISP ingress and egress local routers for the same flow sourced from a domain.

The necessity to split the endpoint identity and locator has been understood since sometime both from routing and security perspective. Today endpoints are identified by IP address that is location dependent and attributed by ISPs, whereas the identity neither depends on location nor on ISP. So splitting the routing and identification space is expected to make network operation such as mobility, multihoming and traffic engineering transparent for the end user. While in the operator side the use of a single space for routing and identification brings scaling issues. The operators will benefit from the split by decreased routing table size. Within IETF/IRTF solutions are being developed to separate the IP layer into Endpoint Identifier (EID) space and routing locator (RLOC) space in the form of Locator/ID Separation Protocol (LISP). In LISP the Identifier (ID) has the format of a IPv4 or IPv6 address. This architecture provides ID to locator resolution so that the packets can be routed through the Internet. This paper proposes a solution that considers an Endpoint Identifier (EID) as the combination of a domain name and a cryptographic Identifier (cryptoID). Such EIDs are hosted in a mixed DNS/Distributed Hash Table (DHT) architecture. Resolution involves a DNS and a DHT resolution. We show how the use of DNSSEC enhances the routing algorithm of the DHT resolution, and present advantages a such an architecture in term of deployment and future use of the Internet.

Internet users seek solutions for mobility, multi-homing, support for localised address management (i.e. via NATs), and end-to-end security. Existing mobility approaches are not well integrated into the rest of the Internet architecture, instead primarily being separate extensions that at present are not widely deployed. Because the current approaches to these issues were developed separately, such approaches often are not harmonious when used together. Meanwhile, the Internet has a number of namespaces, for example the IP address or the Domain Name. In recent years, some have postulated that the Internet's namespaces are not sufficiently rich and that the current concept of an address is too limiting. One proposal, the concept of separating an address into an Identifier and a separate Locator, has been controversial in the Internet community for years. It has been considered within the IETF and IRTF several times, but always was rejected as unworkable. This paper takes the position that evolving the naming in the Internet by splitting the address into separate Identifier and Locator names can provide an elegant integrated solution to the key issues listed above, without changing the core routing architecture, while offering incremental deployability through backwards compatibility with IPv6.

The current Internet addressing architecture does not verify the source address of a packet received and forwarded. This causes serious security and accounting problems. Based on the drastically increased IPv6 address space, a "source address validation architecture" (SAVA) is proposed in this paper, which can guarantee that every packet received and forwarded holds an authenticated source IP address. The design goals of the architecture are lightweight, loose coupling, "multi-fence support" and incremental deployment. This paper discusses the details of design and implementation for the architecture, including inter-AS, intra-AS and local subnet. This architecture is deployed into the CNGI-CERNET2 infrastructure -a large-scale native IPv6 backbone network of the China Next Generation Internet project. We believe that the source address validation architecture will help the transition to a new, more secure and sustainable Internet.

Since recent years, it has been recognized that the existing routing architecture of today's Internet is facing scalability problems. Single numbering space, multi-homing, and traffic engineering, are making routing tables of the default free zone to grow very rapidly. Recently, in order to solve this issue, it has been proposed to review the Internet addressing architecture by separating the end-systems identifiers' space and the routing locators' space.In this paper we review the most recent Locator/ID separation proposal and explore the benefits that such an architecture may bring. In particular, we evaluate the improvements that can be achieved in terms of routing tables' size reduction and traffic engineering.

Very recent activities in the IETF and in the Routing Research Group (RRG) of the IRTG focus on defining a new Internet architecture, in order to solve scalability issues related to interdo-main routing. The approach that is being explored is based on the separation of the end-systems' addressing space (the identifiers) and the routing locators' space. This separation is meant to alleviate the routing burden of the Default Free Zone, but it implies the need of distributing and storing mappings between identifiers and locators on caches placed on routers. In this paper we evaluate the cost of maintaining these caches when the distribution mechanism is based on a pull model. Taking as a reference the LISP protocol, we base our evaluation on real Netflow traces collected on the border router of our campus network. We thoroughly analyze the impact of the locator/ID separation, and related cost, showing that there is a trade-off between the dynamism of the mapping distribution protocol, the demand in terms of bandwidth, and the size of the caches.

Internet Protocol (IP) address management is an increasingly growing concern at Sandia National Laboratories (SNL) and the networking community as a whole. The current state of the available IP addresses indicates that they are nearly exhausted. Currently SNL doesn't have the justification to obtain more IP address space from Internet Assigned Numbers Authority (IANA). There must exist a local entity to manage and allocate IP assignments efficiently. Ongoing efforts at Sandia have been in the form of a multifunctional database application notably known as Network Information System (NWIS). NWIS is a database responsible for a multitude of network administrative services including IP address management. This study will explore the feasibility of augmenting NWIS's IP management capabilities utilizing open source tools. Modifications of existing capabilities to better allocate available IP address space are studied.

Several Internet mapping and topology discovery applications inspect multiple IP (Internet protocol) addresses to discover Internet address regions that are alive, i.e., contain IP addresses that elicit replies to probes. Currently, the traditional approach in examining these IP addresses is completely random, uses exhaustive scan, or focuses on a common wisdom of checking the first IP in each address region. In this paper, we first formalize the discovery process, then we provide an efficient solution to the problem of declaring an address prefix (AP) alive by discovering a reachable host within its addressable range. We develop and evaluate an optimal discovery path that prioritizes and orders probes to a small subset of IP addresses within each AP. Using our optimal discovery path technique, we show that examining a maximum of 11 different IP addresses within each AP successfully reveals the aliveness of more than 90% of the APs.

In order to solve scalability problems of routing and addressing architec-tures of the current Internet, Locator/ID Separation Protocol (LISP) has been proposed. LISP requires mapping resolutions between a locator and an ID and such resolutions may impact on communications. In this paper, we empirically show its impact on in-itiating end-to-end bidirectional communications based upon actual LISP environment. We then discuss solutions to overcome impacts and imply that Data Probe may be a solution by applying it only to DNS queries, responses, TCP SYN and SYN+ACK.

Recently, Locator Identifier Separation Protocol (LISP) has been proposed as an efficient approach for dealing with the problem of scalable Internet routing. To support mobility management in LISP network, the host-based mobility management schemes, such as MIP, can be applied. However, the host-based scheme poses additional functional requirements on mobile node (MN), which is highly undesired for practical application. Furthermore, the complicated binding update process of MIP results in relatively large signaling cost and long handoff latency, making the seamless handoff of MNs impermissible. In this paper, the mobility scenario in LISP network is analyzed in detail and a network-based mobility management scheme is proposed for LISP network, which supports mobility transparency and handoff process simplification. The numerical results demonstrate that the proposed scheme offers better handoff performance comparing to the MIP-based scheme.

ThecurrentInternetarchitecturewasnotdesignedtoeasilyaccommodatemobil- ity because IP addresses are used both to identify and locate hosts. The Locator/Identifier Separation Protocol (LISP) decouples them by considering two types of addresses: EIDs that identify hosts, and RLOCs that identify network attachment points and are used as routing locators. LISP, with such separation in place, can also offer native mobility. LISP-MN is a particular case of LISP which specifies mobility. In this paper we provide a comprehensive tutorial on LISP-MN, showing its main features and how it compares to existing mobility protocols