Locator/Identifier Separation Protocol Research Articles

Designing a Deployable Internet: The Locator/Identifier Separation Protocol

The Internet was designed to interconnect a few hundreds networks, but now has more than a billion hosts. The scalability issues associated with this growth have driven both academia and industry to review the current architecture in the light of the Locator/Identifier Split paradigm. However, changing the routing and addressing architecture of the Internet in an incrementally deployable manner imposes several constraints. The authors use the IETF's Locator/Identifier Separation Protocol (LISP) as a reference to describe different design choices necessary to achieve deployability, which is the ultimate goal of any future Internet architecture.

LISP-MN: Mobile Networking Through LISP

The current Internet architecture was not designed to easily accommodate mobility 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.

Distributed mapping management of identifiers and locators in mobile‐oriented Internet environment

SUMMARYMany schemes have recently been proposed for the separation of identifier (ID) and locator (LOC), which include the Host Identity Protocol, the Identifier‐Locator Network Protocol, and the Locator Identifier Separation Protocol. However, all of these schemes were originally designed in fixed network environment, rather than mobile network environment. In particular, these schemes are based on a centralized map server that is used as an anchor point for mobile nodes, and thus intrinsically subject to some limitations in a mobile environment. In this paper, we propose a distributed ID‐LOC mapping management scheme in a mobile‐oriented Internet environment. In the proposed scheme, we assume that a host has a globally unique and hierarchical Host ID (HID) that contains the information of its home network domain. Each network domain has a distributed map server for distributed management of ID‐LOC mappings. For roaming support, each distributed map server maintains its own home HID register and visiting HID register, which are used to keep the mappings of HID and LOCs for mobile nodes in the distributed manner. By performance analysis, it is shown that the proposed distributed scheme can give better performance than the existing centralized schemes in terms of ID‐LOC binding update and data delivery costs. Copyright © 2012 John Wiley & Sons, Ltd.

Network-Based Distributed Mobility Control in Localized Mobile LISP Networks

In Locator-Identifier Separation Protocol (LISP), the existing mobility control scheme is based on a centralized approach, in which the Map Server is used as a mobility anchor. However, such a centralized scheme has some limitations, including traffic overhead at central server, service degradation by a single point of failure, and larger handover delay. In this Letter, we propose a network-based distributed mobility control in localized mobile LISP networks. From numerical analysis, it is shown that the proposed distributed scheme can provide better performance than the existing centralized scheme in terms of the signaling loads for binding update/query and the handover delay.

Edge router selection and traffic engineering in LISP-capable networks

Recently, one of the problems with the Internet is the is- sue of scalability. To this end, locator/identifier separation protocol (LISP), which separates end-system identifiers and routing locators, has been proposed as a solution. In the LISP deployed network, the ingress and egress nodes of inter-AS traffic is determined by edge router selection (ERS) and endpoint identifier-routing locator mapping assignment (ERMA). In this paper, joint optimizations of ERS and ERMA for stub networks with and without pre- determined link weights are studied and the mixed integer linear programming (MILP) formulations for the problems are given. To make the problem with optimizable link weights tractable, a re- vised local search algorithm is also proposed. Simulation results show that joint optimization of ERS and ERMA enables better net- work performance.

이동 LISP망에서 네트워크 기반 이동성 제어 기법

기존 Locator-Identifier Separation Protocol(LISP) 기반 이동성 제어 기법에서는 각 이동 단말이 Tunnel Router(TR)의 기능을 가진다. 하지만, 이러한 단말 기반 이동성 제어에서는 핸드오버 지연이 길어진다. 본 논문에서는 네트워크에 기반한 이동성 제어 방식을 제안한다. 기존의 단말 기반 이동성 방식과 달리 제안하는 네트워크 기반의 방식은 두 가지 특징을 가진다: 1) 각 TR은 이동 단말이 접속한 Access Router(AR)에 구현된다. 2) 핸드오버를 지원하기 위해 Routing Locator(RLOC) 갱신 동작은 Ingress TR(ITR) 과 Egress TR(ETR) 사이에서 수행된다. 수치 분석 및 비교를 통해 기존의 방식에 비해 제안하는 방식이 핸드오버 지연을 크게 줄일 수 있음을 확인하였다. This paper proposes a network-based mobility control scheme in wireless/mobile networks, which is based on the Locator-Identifier Separation Protocol (LISP). Compared to the existing LISP mobility scheme, the proposed scheme is featured by the following two points: 1) each LISP Tunnel Router (TR) is implemented at the first-hop access router that mobile nodes are attached to, and 2) for handover support, the LISP Routing Locator (RLOC) update operation is performed between Ingress TR and Egress TR. By numerical analysis, it is shown that the proposed scheme can reduce the handover latency much more than the other candidate schemes.

CoreCast: How core/edge separation can help improving inter-domain live streaming

The rapid growth of broadband access has popularized multimedia services, which nowadays contribute to a large part of Internet traffic. Among this content, the broadcasting of live events requires streaming from a single source to a large set of users. For such content, network-layer multicast is the most efficient solution, but it has not found wide-spread adoption due to its high deployment cost. As a result, several application-layer solutions have been proposed based on large-scale P2P systems. These solutions however, are unable to provide a satisfactory quality of experience to all users, mainly because of the variability of the peers and their limited upload capacity. In this paper we advocate for a network-layer solution that circumvents the prohibitive deployment costs of previous approaches, taking advantage of the rare window of opportunity offered by the locator/identifier separation protocol (LISP). This new architecture, motivated by the alarming growth rate of the default-free zone (DFZ) routing table, is developed within the IETF, and aims to upgrade the current inter-domain routing system. We present CoreCast, an efficient inter-domain live streaming architecture operating on top of LISP. LISP involves upgrading some Internet routers and our proposal can be introduced along with these new deployments. To evaluate its feasibility in terms of processing overhead in networking equipment we have implemented CoreCast in the Linux kernel. Further, we compare the performance of CoreCast to the popular P2P streaming services both analytically and experimentally. The results show that CoreCast reduces inter-domain bandwidth consumption and that introduces negligible processing overhead in network equipment.