Locator/ID Separation Protocol Delegated Database Tree (LISP-DDT)
RFC 8111
Document | Type |
RFC - Experimental
(May 2017; No errata)
Was draft-ietf-lisp-ddt (lisp WG)
|
|
---|---|---|---|
Authors | Vince Fuller , Darrel Lewis , Vina Ermagan , Amit Jain , Anton Smirnov | ||
Last updated | 2017-05-26 | ||
Replaces | draft-fuller-lisp-ddt | ||
Stream | IETF | ||
Formats | plain text html pdf htmlized bibtex | ||
Reviews | |||
Stream | WG state | Submitted to IESG for Publication | |
Document shepherd | Luigi Iannone | ||
Shepherd write-up | Show (last changed 2016-06-13) | ||
IESG | IESG state | RFC 8111 (Experimental) | |
Consensus Boilerplate | Yes | ||
Telechat date | |||
Responsible AD | Deborah Brungard | ||
Send notices to | (None) | ||
IANA | IANA review state | Version Changed - Review Needed | |
IANA action state | No IANA Actions |
Internet Engineering Task Force (IETF) V. Fuller Request for Comments: 8111 VAF.NET Internet Consulting Category: Experimental D. Lewis ISSN: 2070-1721 V. Ermagan Cisco Systems A. Jain Juniper Networks A. Smirnov Cisco Systems May 2017 Locator/ID Separation Protocol Delegated Database Tree (LISP-DDT) Abstract This document describes the Locator/ID Separation Protocol Delegated Database Tree (LISP-DDT), a hierarchical distributed database that embodies the delegation of authority to provide mappings from LISP Endpoint Identifiers (EIDs) to Routing Locators (RLOCs). It is a statically defined distribution of the EID namespace among a set of LISP-speaking servers called "DDT nodes". Each DDT node is configured as "authoritative" for one or more EID-prefixes, along with the set of RLOCs for Map-Servers or "child" DDT nodes to which more-specific EID-prefixes are delegated. Status of This Memo This document is not an Internet Standards Track specification; it is published for examination, experimental implementation, and evaluation. This document defines an Experimental Protocol for the Internet community. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Not all documents approved by the IESG are a candidate for any level of Internet Standard; see Section 2 of RFC 7841. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at http://www.rfc-editor.org/info/rfc8111. Fuller, et al. Experimental [Page 1] RFC 8111 LISP-DDT May 2017 Copyright Notice Copyright (c) 2017 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License. Table of Contents 1. Introduction ....................................................4 2. Requirements Language ...........................................5 3. Definitions of Terms ............................................6 4. Database Organization ...........................................8 4.1. XEID-Prefixes ..............................................8 4.2. Structure of the DDT Database ..............................8 4.3. Configuring Prefix Delegation ..............................9 4.3.1. The Root DDT Node ..................................10 5. DDT Map-Request ................................................10 6. The Map-Referral Message .......................................11 6.1. Action Codes ..............................................11 6.2. Referral Set ..............................................12 6.3. "Incomplete" Flag .........................................12 6.4. Map-Referral Message Format ...............................13 6.4.1. Signature Section ..................................15 7. DDT Network Elements and Their Operation .......................17 7.1. DDT Node ..................................................17 7.1.1. Matching of a Delegated Prefix (or Sub-prefix) .....17 7.1.2. Missing Delegation from an Authoritative Prefix ....18 7.2. DDT Map-Server ............................................18 7.3. DDT Client ................................................18 7.3.1. Queuing and Sending DDT Map-Requests ...............19 7.3.2. Receiving and Following Referrals ..................20 7.3.3. Handling Referral Errors ...........................22 7.3.4. Referral Loop Detection ............................22 Fuller, et al. Experimental [Page 2]Show full document text